A B-tree of order 4 is built from scratch by 10 successive

Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?

1. 3
2. 4
3. 5
4. 6

Correct Option: C

Let’s take 10 successive key value {1, 2, 3..........10}