B-Trees
← Back to Self-Balancing Trees
Generalized balanced search tree where nodes can have many children. Optimized for systems that read/write large blocks of data. Keeps tree shallow to minimize disk I/O. Foundational for database indexing (see Relational Databases).