GATE 2019 CS – Question 24
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?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) Non-leaf nodes have pointers to data records
Explanation
In a B$^+$ tree only the leaf nodes hold the pointers to the data records. The non-leaf (internal) nodes hold only keys and child pointers, so B is false.
More File Organization and Indexing (B and B+ Trees) questions
- GATE 2015 CS (CS1) Q32
- GATE 2014 CS (CS2) Q40
- GATE 2016 CS (CS2) Q31
- GATE 2017 CS (CS2) Q59
- GATE 2013 CS Q25
- GATE 2011 CS Q49
All File Organization and Indexing (B and B+ Trees) questions →