Project ForgeDatabase Management Systems
Indexing
GATE 2019
Medium
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?
- AB+ Tree is a height-balanced tree
- Non-leaf nodes have pointers to data records
- CKey values in each node are kept in sorted order
- DEach leaf node has a pointer to the next leaf node
Explanation
In a B+ tree, only LEAF nodes hold pointers to actual data records; non-leaf (internal) nodes contain only key values used purely for navigation to the correct child, never pointers to data records. This makes statement B incorrect.
Source: GATE CS 2019 (Set-2) (2019)
This question is part of a 15-day revision cycle — sign in and Project Forge will bring it back the day before you'd forget it.