reshown by
338 views
1 votes
1 votes
To insert key into level L B/B+ tree maximum new nodes require to create?? And how?
reshown by

1 Answer

0 votes
0 votes
If we consider levels from 0 to L so it may be the case that each level's nodes are completely filled than inserting an element at leaf node may result into splitting it and one element is pushed to upper level, there again splitting happens(in one node) since those nodes are also filled and this phenomena repeats. when we reach to the root node it will also split into two nodes and and new root will be created.

total splitting = L(levels) + 1(root) + 1(new root)

Related questions

2 votes
2 votes
2 answers
1
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
2
Subham Nagar asked Dec 15, 2018
498 views
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-TreePlease also re...
0 votes
0 votes
0 answers
3
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
4
Shamim Ahmed asked Nov 16, 2018
304 views
Why internal node split isn't counted in this question? Only leaf node split is counted.https://gateoverflow.in/1330/gate2009-44