stuk in code logic and set algorithm

how to Write algorithm that stores n distinct words in a binary search tree T of minimal height. then how to show that the derived tree T*, as described in the text, has height [lg(n + 1)] then recursive algorithm to insert a word in a binary search tree.