edited by
21,479 views
50 votes
50 votes

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$
edited by

6 Answers

1 votes
1 votes

start inserting from 1 to 10 in a b-tree you will end up splitting it 5 times

1st split  :while inserting 4

2nd split :while inserting 6

3rd split:while inserting 8

4th and 5th split :while inserting 10

0 votes
0 votes
ans 3
Answer:

Related questions