What is a B-tree?

Approach: Describe self-balancing search tree for storage systems.

A self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. Optimized for systems that read and write large blocks of data.

Follow-up: Why are B-trees used in databases instead of binary trees?

Key concepts: nodes, multi-way search, disk I/O.