If the approach described in the previous problem were implemented as part of the TreeMap class, what additional modifications (if any) would be necessary to a subclass such as AVLTreeMap in order to...

If the approach described in the previous problem were implemented as

part of the TreeMap class, what additional modifications (if any) would

be necessary to a subclass such as AVLTreeMap in order to maintain the

efficiency?

For a standard binary search tree, Table 11.1 claims
O(h)-time performance

for the delete(p) method. Explain why delete(p) would run in

O(1) time if given a solution to Exercise C-11.43.