B-Trees

B-Trees are useful in the following cases:

The number of objects is too large to fit in memory.

Need external storage.

Disk accesses are slow, thus need to minimize the number of disk accesses.

Red-Black trees are not good in these situations, only retrieves one key at a time from memory.