Project #10
Reports Due Monday, April 29, 2002
Extend the binary tree implementation discussed in class with the following methods:
- void printPreOrder() prints the tree using preorder traversal
- void printPostOrder() prints the tree using postorder traversal
- int height() computes and returns the height of the tree.
Height of an empty tree is defined to be -1
- int max() returns the maximum element
- int min() returns the minimum element
In the report include:
- Floppy with all your source files
- Listings of all your programs
- Sample runs that show that your methods work well
- Brief discussion.