Skip to content
UPEEC

B-Trees

Balanced trees with many keys per node, designed for disks and databases.

Advanced
Comments 0

Few levels even for millions of keys — each node fits a disk page.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.