Problem Set 4
- Show a path through the graph in Figure 1 starting at node A, (10 pts)
a. using breadth-first traversal.
b. using depth-first traversal.
- Perform the listed actions on the B-tree shown in Figure 2. Please depict the B-tree both when the value has been added/removed and after any excessively small/large nodes have been fixed. (10 pts)
a. Insert 26.
b. Remove 3 and then 10.
Figure 1. A directed graph
Figure 2. A B-tree with MINIMUM = 1