A B+ tree is the index inside almost every database. Every key, with its row, lives in a leaf; the nodes above hold only separator keys, copies that steer a search, and the leaves are linked in order. A lookup reads one page per level, and a range scan finds its first key once, then walks along the leaves.