GATE CS 2019 Set 1 — Question 24
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyB+ Tree OperationsIndexing & File OrganizationDatabasesB & B+ TreesTreesProgramming & Data Structures
Databases → Indexing & File Organization → B & B+ Trees
Last updated
Question
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?
Correct answer
(B) Non-leaf nodes have pointers to data records
Solution
In a B+ tree:
1.It is a height-balanced tree (Statement A is correct).
2.Internal (non-leaf) nodes store only keys and pointers to child nodes, NOT pointers to actual data records. Data pointers are stored only in leaf nodes (Statement B is incorrect).
3.Keys in nodes are sorted (Statement C is correct).
4.Leaf nodes are linked to form a sequence set for efficient range queries (Statement D is correct).
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Indexing & File Organization
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q15In the context of DBMS, consider the two sets T and S given below. | T | S | |---|---| | I:…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 2 Q20Consider concurrent execution of two transactions and in a DBMS, both of which access a…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…