MADE EASY TEST SERIES

Question

The following key values are inserted into a B+- tree in which order of the internal nodes is 4, and that of the leaf nodes is 3, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node and the order of leaf nodes 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.
The maximum number of times nodes would get split up as a result of these insertions is ________.

Answer:8

 

Plz provide solution for above question

Comments

ans given is wrong

correct ans is 3

---

my ans is 5

---

Magma I also found the same answer .And i also think that the answer given as ten is wrong

---

yes it's wrong  vishal burnwal

Answer 1

The answer is 3.

Comments

Shaijal tripathi I also got the same answer. And I also think that answer given is wrong

---

@Shaijal Tripathi

while inserting 8, why did u move 15 to parent node, why not 20??

i guess it should be 20,

also how can 10 come after 15 in a B+ tree??