Date: Monday, April 26, 2010. Name: ____________________________________________
Show, step by step, how a binary search tree will look like if we
first add, to it, elements 4, 2, 6, 20, and 1, and then delete 4. No
need to balance the tree. For extra credit: show what will
happen if we balance the tree every time.