469 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

Best answer
1 votes
1 votes
Min No of child pointer (x) = 4

Max no ofchild pointer = 2x = 8

Max no of key = 8 - 1 = 7

Related questions

1 votes
1 votes
0 answers
1
0 votes
0 votes
1 answer
2
nitish asked Nov 20, 2016
392 views
Is the Analysis Correct ... Can Any Please help from where to Study About B+ tree Insertion and Deletion .. Its Somewhat confusing too me ...
0 votes
0 votes
1 answer
3
gauravkumawat asked Jun 13, 2023
882 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
4