Name:
Date: Dec 10, 2005
Suppose the following elements are inserted into a binary search tree in the given order:
12, 7, 10, 4, 5, 16, 9, 8, 21
Show the binary search tree after each insertion.
Now suppose elements are deleted from the binary search tree in the same order, that is,
12, 7, 10, 4, 5, 16, 9, 8, 21.
Show the binary search tree after each deletion. (You can write your answer on the back).