CS 2401 Quiz #12

Date: Tuesday, April 27, 2010.
Name: ____________________________________________

Show, step by step, how a binary search tree will look like if we first add, to it, elements 4, 2, 7, 20, and 10, and then delete 7. No need to balance the tree. For extra credit: show what will happen if we balance the tree every time.