recategorized by
640 views
0 votes
0 votes
A B tree has order 10. Suppose it's leaf node already has 9 elements and one more element is inserted in it and split occurs. Now my question is is it always necessary that the split is of size 4 and 5 ie left child contain 4 values and right child node contain 5 values? Or it could also be 5 and 4? Thanks.
recategorized by

1 Answer

Best answer
2 votes
2 votes
split can be either from 4 to 5 or from 5 to 4 depending on options implement it,since it is ambiguous these type of questions have less chances to come.
selected by

Related questions

134
views
0 answers
0 votes
SandeepKumar147 asked Apr 25
134 views
563
views
0 answers
0 votes
Sahil_Lather asked Jan 29, 2023
563 views
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
2.1k
views
3 answers
0 votes
Na462 asked Feb 2, 2019
2,138 views
390
views
0 answers
0 votes
bts1jimin asked Jan 9, 2019
390 views
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?