1.

Algorithms: Consider a B-tree of order 4 and is built from scratch by 10 successive insertions. What would be the maximum number of node splitting operations that take place?

A. 6
B. 3
C. 4
D. 2
Answer» E.


Discussion

No Comment Found