In RDBMS indexing, B+ trees are preferred over binary search trees mainly because:
- AB+ trees always require less total storage space
- BDisk access is far slower than memory access, and a B+ tree's structure minimizes the number of disk blocks that must be read to locate a record
- CB+ trees can never become unbalanced
- DA binary search tree cannot store more than one key per node
Correct answer: B