NAME:

PRECEPT:

COS 226 Exercises on Symbol Tables

2. Draw the binary search tree that results when you insert the keys A N O T H E R E X A M P L E in that order into an initially empty tree, using the root insertion method.

3. Draw the 2-3-4 tree that results when you perform top-down insertion of the keys A N O T H E R E X A M P L E in that order into an initially empty tree.

4. Draw the red-black tree that results when you perform top-down insertion of the keys A N O T H E R E X A M P L E in that order into an initially empty tree.

5. Draw the splay tree that results when you insert the keys A N O T H E R E X A M P L E in that order into an initially empty tree.

Due: in precept on March 5 or 6.

Do your work on this page (use the back if you must)