B+-trees vs. balanced BSTs for a disk-backed index

A balanced binary search tree (e.g. a red-black tree) and a B+-tree both give O(log n) search complexity measured in key comparisons. Why do virtually all disk-backed database indexes use B+-trees instead of balanced BSTs?

3 of 46 in Data Structures & Algorithms