Lecture 21

Learning objectives

After this class, you should be able to:

1. Give the definition of a B-Tree and explain its idea.
2. Explain the advantage of a B-Tree over an AVL tree when data resides on disk.
3. Given a sequence of inserts and deletes on a B-Tree, show the state of the B-Tree after those operations.

Reading assignment

1. Section 4.7.
2. Lecture: B-Trees.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Show the B-tree that results after inserting 25 into the B-Tree of figure 4.66.
  2. Show the B-Tree that results after inserting 25.5 into the answer of the previous question.
  3. Show the B-tree that results after deleting 6 from the B-Tree of figure 4.66.

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