2,572 views
1 votes
1 votes
The minimum number of keys in a B+ tree is 3. The maximum number of keys in any non root
node is ____.

1 Answer

0 votes
0 votes

It will be 7.

For a B+ tree,

Minimum number of keys = Minimum number of block pointers - 1

And minimum number of block pointers for a B+ tree in any non root node is given as  $\left \lceil \frac{p}{2} \right \rceil$ where p is the maximum number of block pointers. For a root node, minimum number of block pointers is 2 as minimum 1 key value must be present

For your question, minimum number of block pointers = 3 + 1 = 4

that gives $\left \lceil \frac{p}{2} \right \rceil$ = 4 , So p = 8.

So, maximum number of keys = 8 - 1 = 7

Related questions

0 votes
0 votes
1 answer
1
gauravkumawat asked Jun 13, 2023
885 views
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
3
Crackcer asked Jan 10, 2022
237 views
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
2 votes
2 votes
2 answers
4