Data Structures:

C. I, 4, l0, 44, O, PROBLEM 3 (Sedgewick & Wayne) Give pseudocode for a binary search tree method height ) that computes the height of the tree. Develop two implementations: the first, a recursive method (which takes linear time and space proportional to the height)