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?
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?
Show Hint
Key difference to remember:
{B-tree} may store data pointers in internal nodes,
but {B$^+$ tree} stores all data pointers {only at leaf nodes}.
Updated On: Feb 8, 2026
- B$^+$ tree is a height-balanced tree
- Non-leaf nodes have pointers to data records
- Key values in each node are kept in sorted order
- Each leaf node has a pointer to the next leaf node
Hide Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
Step 1: Recall the structure of a B$^+$ tree.
A B$^+$ tree is a balanced search tree widely used for indexing in databases. It stores keys in internal nodes and actual data record pointers only at the leaf nodes.
Step 2: Analyze each statement.
(A) B$^+$ tree is a height-balanced tree
This statement is correct. All root-to-leaf paths in a B$^+$ tree have the same length, ensuring balanced height.
(B) Non-leaf nodes have pointers to data records
This statement is incorrect. In a B$^+$ tree, non-leaf (internal) nodes contain only keys and pointers to child nodes, not pointers to actual data records. Data record pointers exist only in the leaf nodes.
(C) Key values in each node are kept in sorted order
This statement is correct. Sorted keys enable efficient searching and range queries.
(D) Each leaf node has a pointer to the next leaf node
This statement is correct. Leaf nodes are linked together to support efficient sequential and range access.
Step 3: Conclusion.
The statement that is NOT correct about a B$^+$ tree is: \[ \boxed{\text{Non-leaf nodes have pointers to data records}} \]
A B$^+$ tree is a balanced search tree widely used for indexing in databases. It stores keys in internal nodes and actual data record pointers only at the leaf nodes.
Step 2: Analyze each statement.
(A) B$^+$ tree is a height-balanced tree
This statement is correct. All root-to-leaf paths in a B$^+$ tree have the same length, ensuring balanced height.
(B) Non-leaf nodes have pointers to data records
This statement is incorrect. In a B$^+$ tree, non-leaf (internal) nodes contain only keys and pointers to child nodes, not pointers to actual data records. Data record pointers exist only in the leaf nodes.
(C) Key values in each node are kept in sorted order
This statement is correct. Sorted keys enable efficient searching and range queries.
(D) Each leaf node has a pointer to the next leaf node
This statement is correct. Leaf nodes are linked together to support efficient sequential and range access.
Step 3: Conclusion.
The statement that is NOT correct about a B$^+$ tree is: \[ \boxed{\text{Non-leaf nodes have pointers to data records}} \]
Was this answer helpful?
0
0
Top Questions on Data Structures
- What is the value of the postfix expression: $6\ 12\ 2\ 4\ +\ /\ *\ ?$
- Consider the following C function foo(int n). How many times does foo(2) get called on making the call foo(5)?
C Function:
float foo(int n){ if(n <= 2) return 1; else return (2*foo(n-1) + 3*foo(n-2)); } - Suppose you are given pointers to the first and the last nodes of a singly linked list, which one of the following operations would require traversal of the linked list?
- What is the time complexity of the Bellman-Ford single-source shortest path algorithm on a completely connected weighted graph of $n$ vertices?
- How many null links does an arbitrary binary tree with $n$ nodes have?
View More Questions
Questions Asked in GATE CS exam
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture
- For $\Sigma = \{a,b\}$, let us consider the regular language $L = \{x \mid x = a^{2+3k} \text{ or } x = b^{10+12k},\; k \ge 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$?
- GATE CS - 2026
- Theory of Computations
View More Questions