Redo the previous exercise, including all methods of the Sorted Map ADT. (See Section 10.3.) Redo Exercise P-11.63 providing positional support, as we did for binary search trees (Section 11.1.1),...

Redo the previous exercise, including all methods of the Sorted Map ADT.

(See Section 10.3.)

Redo Exercise P-11.63 providing
positional
support, as we did for binary

search trees (Section 11.1.1), so as to include methods first( ), last( ),

before(p), after(p), and find position(k). Each item should have a distinct

position in this abstraction, even though several items may be stored

at a single node of a tree.