Lab 5. Binary Search Tree
CS203,
Spring 2006
1. Complete the following methods in the BSTree class. You may add more methods if necessary.
- (25pt) Comparable remove( Comparable o )
- (5pt) Comparable find( Comparable o )
- (5pt) Comparable min()
- (5pt) Comparable max()
2. (Extra credit 15pt) Modify print() and related method(s) in the BSTree class so that the output is indented according to the level of the nodes.
![[Tree Figure]](tree.jpg "Tree")
For example, for a tree as shown in the figure above, using in-order traversal, the output should be
10
3. Turn in all the source code files through
CSNS.