Which one of the following statements is NOT correct about the B+ tree data…
2019
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
- A.
B+ Tree is a height-balanced tree
- B.
Non-leaf nodes have pointers to data records
- C.
Key values in each node are kept in sorted order
- D.
Each leaf node has a pointer to the next leaf node
Attempted by 339 students.
Show answer & explanation
Correct answer: B
Answer: The statement "Non-leaf nodes have pointers to data records" is NOT correct because in a B+ tree only leaf nodes contain pointers (or copies) to the actual data records; internal nodes store keys and pointers to child nodes.
B+ trees are height-balanced: all leaves are at the same depth, which keeps search costs uniform.
Keys in each node are kept in sorted order to direct searches to the correct child or leaf.
Leaf nodes are linked (each leaf points to the next leaf) to support efficient range queries and ordered scans.
Because internal nodes do not point to records, searches always descend to the leaf level where the record pointers are stored.
A video solution is available for this question — log in and enroll to watch it.