CSSE 230: Session Notes - Day 9

Topics

1. Balanced Binary Search Trees: AVL Trees

Outline

1. [5 min] Contact before work.
2. [30 min] Balanced binary search trees: AVL Trees
3. [10 min] Applet for inserting into an AVL tree.
4. [10 min] Discussion of the mechanics of the insert and balancing methods.
5. [5 min] Break
6. [50 min] Work on homework.

Materials

• Worksheet for inserting into an AVL tree.
• Java code to visualize the effects of the operations on your tree. Notice that this code is useful for debugging. You run it as an application. Your code still needs to pass all of our unit test cases.
• Video explaining the slides that introduce AVL trees
• Video giving guidelines for implementing AVL trees

Homework

1. Day 13, 23:59: AVL Trees