In a B+ tree index, where are the pointers to actual data records (or the records themselves) stored?
Correct answer C. Only in the leaf nodes, which are linked together
Explanation
A B+ tree keeps all data entries in its leaf level; internal nodes hold only separator keys that guide the search. The leaves are linked in key order, so a range query finds the first key and then scans along the leaves. Storing record pointers in internal nodes as well is a feature of the plain B tree, which makes range scans less convenient.
Answer checked How we write and check questions
Discussion