Lecture 19

Learning objectives

After this class, you should be able to:

1. Derive the time complexity for insert, delete, and search on an AVL tree.

Reading assignment

1. Section 4.4.
2. Lecture: Trees: Part 4 -- AVL trees.
3. None.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Let the balance factor of a node be defined by | Height of right sub tree - Height of left sub tree |. Give the balance factor for the nodes in slides 27-30. Instead of storing the heights of the nodes, can we store the balance factors of the nodes and update an AVL tree (for insertion and deletion) based on this information?

• Questions on next lecture's material
  1. None.