Part A) AVL Tutorial -- due 5pm on Friday 3/29 -- 25 points

Make an AVL tree teaching tool, as a powerpoint presentation. Content should include the basic structure of an AVL tree, primary operations (find, insert, remove) and rebalancing rotations. Use animations if possible to demonstrate the operations. You should also explain the efficiency of the operations. Submit this as a powerpoint document, as hwEx on Blackboard.

Part B: BST & AVL BoundedOrderedSets, due 4/5

Implement the Bounded operations for BST & AVL trees. See assignment 8 for details.

Part C: Graph Extension, due 5/3

Something with graphs. See assignment 12 for details.