Data lives on disk, and each disk read is slow, so a search structure must keep the number of reads tiny. B and B+ trees are wide, balanced trees where one node fills a disk block, giving only three or four levels for millions of keys. B+ trees win for databases because linked leaves make range queries cheap. A binary search tree is fine in memory but far too deep on disk, and "why B+ tree?" is a classic interview question.