COS 226 Homework #4
Due: Tuesday, March 8, 2005
Written Exercises
Follow the instructions on the assignments
page on how and when to turn these in. Each of these problems is worth 4
points. Be sure to also complete the programming part
of this assignment, including the program report.
- Draw the binary search tree that results when you insert the following
keys in that order into an initially empty tree, using the standard
algorithm.
N O T H E R X M P L
- Starting from the BST above, insert Q using the root insertion
method. Draw the resulting tree.
- Draw the red-black tree that results when you perform top-down insertion
of the following keys in that order into an initially empty tree.
N O T H E R X M P L