Question

A B+ tree is preferred over a B-tree for databases because _______ .

• A. It supports range queries efficiently
• B. It has a smaller node size
• C. It allows faster insertion/deletion
• D. It uses less disk space

Hint:

B+ trees are ideal for database indexing and range queries because of their efficient leaf node linkage and data retrieval method.

Answer 1

The Correct Option is A

The B+ tree is an enhancement of the B-tree that stores data only in the leaf nodes and uses linked leaves for efficient range queries. This allows for faster sequential access to data compared to the B-tree, which stores keys in both internal and leaf nodes.