The GATE Grind

GATE 2019 CS – Question 24

Databases · File Organization and Indexing (B and B+ Trees) · 1 mark · Multiple choice

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?

  1. B$^+$ Tree is a height-balanced tree
  2. Non-leaf nodes have pointers to data records
  3. Key values in each node are kept in sorted order
  4. Each leaf node has a pointer to the next leaf node

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.