Problem
1. Discuss the advantages of using each of the following instead of the other:
(a) A binary search tree with a balancing mechanism
(b) A 3-2 tree
2. Give at least two examples of situations in which hashing are not appropriate.
3. Let S and T be two arrays of n numbers that are already in no decreasing order. Write an algorithm that finds the median of all 2n numbers whose time complexity is in Θ (lg n).