Lecture 20

Learning objectives

After this class, you should be able to:

  1. Write code implementing self-restructuring BSTs, using single rotations (move-up) and move-to-root.
  2. Given a sequence of insert and search operations on a BST, draw the resulting tree when one of the self-restructuring techniques mentioned above is used.
  3. Given an application, suggest a suitable self-restructuring technique for it (which may be different from those discussed in class).

Reading assignment

  1. Class notes.
  2. Lecture: Self-adjusting trees.

Exercises and review questions


Last modified: 19 Oct 2011