Homework 7.
Due, Wednesday, November 17, 2PM

1) Goodrich and Tamassia 
 Problem R-9.1, then show what the tree looks like after
24 is deleted.

2) Goodrich and Tamassia 
  Problem R-8.4

3) Give a java method that returns a linked list containing
all the elements in a binary search tree that have key k.