500 views
0 votes
0 votes
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree

Please also refer the source from where clear-cut formulae are given

1 Answer

3 votes
3 votes

Number of Keys Present in Internal Nodes of Both B and B+ Trees are govern by the Formula

[ Ceil( p/2 ) - 1 to p-1 ] , where p is the Order of the Tree.

And For the root the formula is :[1, p-1]

Solution of the Question: Given that p-1 =11 , so p=12.

Hence the Order of  the B+ tree is 12

Applying the Formula :  [ Ceil( 12/2 ) - 1 to 12-1 ] , answer turn out to be: [5,11]

So the Minimum number of keys Present will be 5

 

 

Related questions

2 votes
2 votes
2 answers
1
aditi19 asked Nov 23, 2018
1,604 views
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
0 votes
0 votes
0 answers
2
Shamim Ahmed asked Nov 16, 2018
279 views
https://gateoverflow.in/3723/gate2004-it-79In the above question why record pointer is considered in internal node size calculation?
0 votes
0 votes
0 answers
3
Shamim Ahmed asked Nov 16, 2018
305 views
Why internal node split isn't counted in this question? Only leaf node split is counted.https://gateoverflow.in/1330/gate2009-44
0 votes
0 votes
1 answer
4