A real data base consists of several trees, one for each key. The only key that you are using in this assignment is a unique key: college code. Another key could be the name of the college, or the rank. In you wish to be able to search by name or by rank, you will need two more trees: one sorted by name, and the other one sorted by rank. How would you generalize your code
