b-trees

What problem does it solve?

B-trees are essential for reasoning about external-memory indexes and high-fanout structures, helping you design, analyze, and reason about disk-efficient data layouts.

Core Features & Use Cases

• Understand B-tree invariants, splitting/merging strategies, and height bounds.
• Compare with B+-trees and red-black trees for storage engines, databases, and index design.
• Work through encode/decode of disk-block models and how node capacity affects performance.

Quick Start

Walk through a small B-tree example and trace insertions, deletions, and splits to observe height changes.