B-Tree

Not to be confused with a Binary Tree. B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.

BTrees are used for databases apparently? Saw this mentioned a few times in the CS348 slides.