Question:-
53. If the following elements are inserted in the given order into initially empty B+tree in which each node can hold at most 4 pointers, what will be the number of leaf nodes in the B+ tree at the end of the insertions?
1 3 5 6 7 8 14 22 32 33 37
Option (A)
4
Option (B)
5
Option(C)
6
Option(D)
7
Correct Option:
()
question-answer-faq-2452