How does a B+ tree differ from a B-tree?
Correct answer C. All data records are stored in the leaves, and the leaves are linked for sequential access
Explanation
In a B+ tree, internal nodes hold only keys that guide the search, while every record, or pointer to one, sits in a leaf. The leaves are chained together, so range queries can scan them in order without returning to the root. That is why database and file-system indexes favour B+ trees. Both kinds are multiway trees and both stay balanced.
Answer checked How we write and check questions
Discussion