B-Tree

A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient searching, insertion, and deletion. Unlike binary trees, B-trees can have more than two children per node (typically optimized for disk-based storage where accessing nodes is costly). They are commonly used in databases and file systems to index large amounts of data.