retagged by
10,416 views
18 votes
18 votes

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
retagged by

3 Answers

Best answer
34 votes
34 votes
Properties of B+ trees:
1. B+ tree is height balance tree.
2. Key value is in sorted order.
3. Leaf node has pointer to next leaf node.
4. Non leaf node has pointer to a node (leaf or non leaf) and not pointer to data record.

Option B is not correct.
edited by
1 votes
1 votes
Only leaf nodes have pointer for the data records, hence option B is not a property of a B+ tree.

Therefore, option B is correct answer.
0 votes
0 votes
Option B is correct

root node and internal node of  B + tree does not contain Data pointer/record pointer only leaf node will contain .

and in B tree root node , internal node as well as Leaf node will also contain Data Pointer .
Answer:

Related questions

39 votes
39 votes
5 answers
3
Arjun asked Feb 7, 2019
27,269 views
A relational database contains two tables Student and Performance as shown below:$$\overset{\text{Table: student}}{\begin{array}{|l|l|} \hline \text{Roll_no} & \text{Stud...
32 votes
32 votes
2 answers
4
Arjun asked Feb 7, 2019
14,155 views
Consider the following relations $P(X,Y,Z), Q(X,Y,T)$ and $R(Y,V)$.$$\overset{\textbf{Table: P}}{\begin{array}{|l|l|l|} \hline \textbf{X} & \textbf{Y} & \textbf{Z} \\\hli...