Binary Search in Trees
Problem : We provided a rather simple function for adding a new element to a binary search tree. We neglected, however, to show how to remove an element. Write a function that will remove an element from a binary search tree.
Problem : You are given a set of phone numbers and the names of people to whom they belong. You are to create a binary search tree to quickly look up people based on their phone numbers. What sort of data will you put into the nodes and by what piece of the data will the tree be ordered?
Problem : Assuming the data is given to you in random order, how might you create the binary search tree and what is the complexity of this operation?