Question

Dictionary implementation using binary search tree in java

Answer 1

don't mplement this yourself, it really is non-trivial. Use the TreeMap provided by Java. Internally, TreeMap uses a Red-Black tree to keep the tree balanced. Red-Black trees are binary search trees guaranteeing a height which is logarithmic in the number of leave nodes.