Which one of the following statements is NOT correct about the B+ tree data structure used for index

Q: What is GATE-CS?

GATE-CS is a competitive examination conducted in India. This question is from the 2019 GATE-CS Database Management Systems paper.

Q: How can I prepare for GATE-CS Database Management Systems?

To prepare for GATE-CS Database Management Systems, practice previous year questions (PYQs), understand concepts thoroughly, and solve mock tests regularly. This 2019 question covers Indexing (B-Trees and B+ Trees) topic.

Q: What is the difficulty level of this question?

This GATE-CS 2019 Database Management Systems question has a easy difficulty level and is marked as an important question and is one of the most repeated questions.

Q: Where can I find more GATE-CS previous year questions?

You can find more GATE-CS previous year questions on AspirantMitraa. Browse by subject, topic, year, and difficulty level to practice effectively.

Question

Which one of the following statements is NOT correct about the B+ tree data structure used for indexing a relational database table?

Accepted Answer

Correct Answer: (B) Non-leaf nodes have pointers to data records — this is NOT correctConcept: B+ Tree StructureIn a B+ tree, a key distinction from a B-tree (without the '+') is where data record pointers reside. In a B+ tree, only the leaf nodes contain pointers to the actual data records. Internal (non-leaf) nodes contain only key values and child pointers (pointers to other tree nodes), not pointers to data records. This design allows all data records to be accessed via the linked list of leaf nodes, supporting efficient range queries by sequential traversal of leaves.Options (A), (C), (D) are all TRUE: A B+ tree is height-balanced (all leaves at the same depth). Keys within each node are maintained in sorted order to support binary search within a node. Each leaf node has a 'next leaf' pointer forming a linked list, enabling sequential scans.Definition: A B+ tree is a balanced tree where all data records are stored in leaf nodes, and internal nodes only store keys to guide search.

Which one of the following statements is NOT correct about the B+ tree data structure used for indexing a relational database table?

Master GATE-CS with Our Test Series

More Questions from Indexing (B-Trees and B+ Trees)

Frequently Asked Questions

Which one of the following statements is NOT correct about the B+ tree data structure used for indexing a relational database table?

Master GATE-CS with Our Test Series

More Questions from Indexing (B-Trees and B+ Trees)

Frequently Asked Questions