Lecture 17

Learning objectives

After this class, you should be able to:

1. Define an AVL search tree..
2. Write code to implement insertion into an AVL tree, and give its time complexity.
3. Given a sequence of insertions into an AVL tree, draw the 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. Insert the following elements into an AVL search tree in the order given below and draw the resulting tree: 10, 8, 4, 2, 0, 3, 7, 6, 5.
  2. Write code to implement a single rotation on an AVL tree for case 4 (rotateWithRightChild).

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

---

Last modified: 6 Oct 2011