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 accurately

maintain the reference to the leftmost position?

Describe a modification to the binary search tree implementation having

worst-case
O(1)-time performance for methods after(p) and before(p)

without adversely affecting the asymptotics of any other methods.