I have a BST which takes in an arbitrary list of words, and outputs the occurrences of each word in alphabetical order:
1. What is the height of the tree given that the words are inserted in random order? (English text is not random)
2. Best comparison-based sorting algorithms require O(nlogn) comparisons, n is the number of items being sorted, for their worst case input. Given that, how long does it take to insert m unique words into a B-tree?