B-tree

A B-tree groups sorted keys into wide nodes and keeps all leaf nodes at the same depth.

For example, a database index can use a B-tree to find one key among millions after reading only a small number of disk pages.