Deletion in Two Boring Slides of Text

• Remove the key from its leaf

• If the leaf ends up with fewer than ?L/2? items, underflow!

  • Adopt data from a neighbor; update the parent
  • If borrowing won’t work, delete node and divide keys between neighbors
  • If the parent ends up with fewer than ?M/2? items, underflow!

Why will dumping keys always work if borrowing doesn’t?

Previous slide

Next slide

Back to first slide

View graphic version