An alternative algorithm for insertion into a B-tree is the following: As the insertion algorithm travels down

Question:

An alternative algorithm for insertion into a B-tree is the following: As the insertion algorithm travels down the tree, each full node that is encountered is immediately split, even though it may turn out that the split was unnecessary.
a. What is the advantage of this technique?
b. What are the disadvantages?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: