Java Software Structures, 4th Edition Exercise Solutions, Ch. 14
Chapter 14 Exercise Solutions
EX 14.1. Draw the 2-3 tree that results from adding the following elements into an
initially empty tree:
34 45 3 87 65 32 1 12 17
EX 14.2. Using the resulting tree from Exercise 14.1, draw the resulting tree after
removing each of the following elements:
3 87 12 17 45
EX 14.3. Repeat Exercise 14.1 using a 2-4 tree.
EX 14.4. Repeat Exercise 14.2 using the resulting 2-4 tree from Exercise 14.3.
EX 14.5. Draw the B-tree of order 8 that results from adding the following elemets
into an initially empty tree:
EX 14.6. Draw the B-tree that results from removing the following from the resulting
tree from Exercise 14.5:
EX 14.7. Describe the complexity (order) of insertion into a B-tree.
EX 14.8. Describe the complexity (order) of deletion from a B-tree.
Like insertion, the complexity of deletion from a B-tree is logarithmic. That is, O(log n).