Doubt in gate 2009 B+-tree question

Question

https://gateoverflow.in/1330/gate2009-44

Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing.

Do we split every time a node is full? Even when its siblings have space?

Thank You.

Answer 1

have to take maximum number of splits possible from left and right biasing :

Caption

Comments

Thanks :)

I still have a few doubts:

1. So when we do left biasing, the parent node's key holds the largest value of the left child. Like in the diagram of left bias after inserting 6, we have 6 in the parent and not 10. 

And in right bias, the parent's key hold the smallest value of right child.

Am I correct?

2. We split the node whenever it exceeds the maximum capacity, without looking at the left or right sibling. Correct? Have a look at these three videos in this channel: https://www.youtube.com/channel/UCbowfWkY0jVt2eM_r9oOUVA

---

yes, both of your points are correct.