What is a B-Tree?

Approach: Define a self-balancing search tree used in storage systems.

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

Follow-up: Why are B-trees used for disk storage?

Key concepts: multi-way, external storage, indexing.