Why are B+ Trees preferred over B-Trees for disk-based database indexing?

Subject: Database Management Systems

Topic: B+ Trees & Disk Indexing

Options:

1. Option A: Data pointers are stored in root node only
2. Option B: Leaf nodes store all data & are linked sequentially for fast range queries
3. Option C: B+ Trees have lesser height than binary trees
4. Option D: B+ Trees eliminate key duplication

Correct Answer:

Option B: Leaf nodes store all data & are linked sequentially for fast range queries

Explanation:

B+ Trees store all actual data pointers in linked leaf nodes, enabling efficient sequential range scans and fewer disk I/Os.