Problem
1. Suppose that a[i] == 2*i for 1 ≤ i ≤ N. How many table positions are examined by interpolation search during the unsuccessful search for 2k - 1?
2. Draw the binary search tree that results from inserting into an initially empty tree records with the keys EA SYQUESTIO N.
3. Write a recursive program to compute the height of a binary tree: the longest distance from the root to an external node.