Data Structures

A revision of the data structures lab to make it more manageable in a two hour time frame.
The remove method for binary trees is extremely hard. My and Marissa's suggestion is and has been that it be removed from the lab and replaced a conception question about binary tree removal. This algorithm alone would probably take students the full two hours, if not more. In addition, a binary search tree object, once created, is very difficult to test, because there is no particularly simple way to represent it as a string (and the explanation for such a method would certainly contribute to increasing the lab length).