A B+ tree index is generally preferred over a plain binary search tree for indexing database records mainly because:
- AB+ trees use less memory overall
- BA B+ tree's smaller height (due to high branching factor) reduces the number of disk accesses needed
- CB+ trees don't require sorted data
- DBinary trees cannot store duplicate keys
Correct answer: B