Data Structures Homework for Week 5. 



1. Define AVL tree.
Tree.pdf
2. Consider the AVL tree in the attached PDF file. Insert a node with key value 55 and rebalance if necessary.

3. Consider the AVL tree in the attached PDF file. Delete the node with key value 42 and rebalance if necessary.

4. Draw an example of an AVL tree such that a single delete operation could require ϴ(log n ) restructuring operations. 

Posted: Thu - February 1, 2007 at 04:39 PM          

©