retagged by
1,074 views
6 votes
6 votes

Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..

retagged by

1 Answer

Best answer
6 votes
6 votes
Just give a try for this =>

10, 3, 6, 8, 4, 2, 1

A). Use left biasing --> total 5 splits (4 leaf node and 1 internal node)

B). Use right biasing --> total 4 splits (3 leaf and 1 internal node)
selected by

Related questions

1 votes
1 votes
1 answer
2
Na462 asked Jun 29, 2018
607 views
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
2 votes
2 votes
2 answers
3
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?
2 votes
2 votes
1 answer
4
skywalker_19 asked Oct 8, 2018
653 views
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree