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
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?
Step by Step Solution
3.30 Rating (156 Votes )
There are 3 Steps involved in it
a The advantage of this technique is that it reduces the num... View full answer
Get step-by-step solutions from verified subject matter experts
