3,217 views
2 votes
2 votes
Which of the following is not correct about B + Tree, which is used for creating index
of relational database table?
(a) Key values in each node kept in sorted order
(b) Leaf node pointer points to next node
(c) B + tree is height balanced tree
(d) Non-leaf node have pointers to data records

2 Answers

4 votes
4 votes
d is incorrect statement.In B+ tree all the data records are in leaf , that is the main difference b/w B+ Tree ane B tree

Related questions

0 votes
0 votes
1 answer
1
Prince Sindhiya asked Jan 2, 2019
729 views
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
1 votes
1 votes
2 answers
2
CHïntän ÞäTël asked Dec 10, 2018
1,011 views
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
0 votes
0 votes
1 answer
3
aditi19 asked Nov 23, 2018
423 views
can anyone share some good resources fot B+ tree deletion?
0 votes
0 votes
1 answer
4
Akriti sood asked Jan 11, 2017
1,165 views
between B trees and B+ trees,which one is suited for random and which one is suited for sequential access??please explain