Data Structures
FALL 1998
HOMEWORK 2
Due: October 28th
This project is based on Project P-5.3 on page
200 of our text.
Implement the binary tree ADT using a sequence.
The standard
operations should certainly be supported.
Since this is an exercise, informative messages should be
produced whenever an object is inserted or
deleted from the tree.
As part of the information, use the
indented parenthetic representation
described in C-5.2 on Page 197 of our text
to display the tree at each stage.
Test your implementation with sufficient test cases.
Turn in 1) your source listing and 2) output from
your tests. (No disks are needed)