2,010 views
0 votes
0 votes

1 Answer

Best answer
3 votes
3 votes
The answer should be 10. In a B+ tree the data is stored in the last level i.e on the leaf node. So going by the question-

Order_leaf=2

Order_internal=3

Thus for a complete b+tree each  internal level should have  order_internal children.

if order is k and tree is complete-

Level 1 has k-1 keys and k children

Level 2 has k*(k-1) keys and k*k children if its internal node

Level 3 has k*k*(k-1) keys and k*k*k children if its internal node

and so on

Clearly here we have two levels of internal node whihc means k*k children i.e 3*3=9 leaf nodes

Also the order of leaf node is 2  so the number of total keys at leaf nodes=

No of leafnodes* order_leaf=9*2=18

Clearly here only 8 keys are present in leaf nodes so we can have 10 more keys inserted.
selected by

Related questions

0 votes
0 votes
1 answer
1
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
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