← Glossary
What does "B-tree" mean in programming?
B-tree is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.
Definition
A self-balancing search tree designed for systems that read and write large blocks of data (like disks). Each node can have many children, keeping the tree shallow. Database indexes and file systems widely use B-trees and their variant B+ trees.
Example
"PostgreSQL uses B-tree indexes by default because they support range queries efficiently."
Related terms
Ready to practice your English at work?
Lingua-e has interactive exercises built around real developer conversations: standups, code reviews, retrospectives, and more. Practice until it comes naturally.
Try Lingua-e for free