The Gateway to Computer Science Excellence
+5 votes
1.9k views

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
in Databases by Veteran (423k points)
edited by | 1.9k views
+2
B is the correct answer.

1 Answer

+16 votes
Best answer
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.
by Veteran (60.4k points)
edited by
0

@Digvijay Pandey

is B tree also height balance tree??

as like B+ tree in B also all leaf are same node so B is also height balanced tree 

am I correct?

0

@jlimbasiya, yes! you are correct, B-tree is also height balanced tree:)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,650 questions
56,242 answers
194,288 comments
95,936 users