1,319 views
1 votes
1 votes

Consider a $B^+$ tree , in which order of internal nodes is 4 and order of leaf nodes is 3. The order of internal nodes is the maximum number of tree pointers in each internal node and the order of leaf node is the maximum number of data items that can be stored in each node.

Keys are inserted into following order

$50,15,30,40,35,20,8,10,5$

The maximum number of times nodes would split up is?

I did in below way and I got 3 splits, assuming B+ tree with left biasing.

But the answer is given to be 8. Have I made any mistake?

1 Answer

Related questions

0 votes
0 votes
0 answers
1
bts1jimin asked Jan 9, 2019
375 views
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
2 votes
2 votes
2 answers
2
aditi19 asked Nov 23, 2018
1,600 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
1 answer
3
Vishnathan asked Aug 24, 2018
8,172 views