What is the result of removing the 10 from the 2-3 tree that you created in Checkpoint Question 1?
Question 1
To be sure that you fully understand the insertion algorithm, insert 32 into the 2-3 tree in Figure 19-11. The result should be the tree shown in Figure 19-6 b. Once again, compare this tree with the binary search tree in Figure 19-6 a and notice the dramatic advantage of the 2-3 tree's insertion strategy.
