retagged by
8,526 views
1 votes
1 votes

If following sequence of keys are inserted in a B+ tree with K(=3) pointers:

8, 5, 1, 7, 3, 12, 9, 6

Which of the following shall be correct B+ tree?

retagged by

3 Answers

Best answer
3 votes
3 votes

8, 5, 1, 7, 3, 12, 9, 6 

first 8,5 will enter in the node then 1 comes so node will split from the middle and 5 becomes parent and its copy is retained in leaf node  at left side . rest process is given in given pic

so ans is 1

note only when a leaf node is split it s copy is retained in leaf node . when an internal node is split then there is no need of copying it as its copy is already in leaf node earlier 

edited by
Answer:

Related questions