MadeEasy Test Series: Databases - B Tree

Question

The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal node is the maximum number of tree pointers in each node and the order of leaf node is the maximum number of data items that can be stored in it.

The B+ tree is initially empty  50,15,30,40,35,20,8,10,5 are inserted.The Maximum number of times nodes get spilt up as a result of these insertion ___

Comments

The Maximum number of times nodes get spilt up as a result of these insertion ___

I suppose this is the reason they have arranged this way where we get maximum node splits.

But I am not sure if this is the reason. Also, does this mean that we get different answers on using left or right biasing?

---

Yes if right biasing is used in worst case also answer is coming 3

---

In such questions we have to find the no. of splits using both methods(Left and right biasing) and choose the maximum or minimum as asked in the question.