Describe a set of operations for an ordered dictionary ADT that would correspond
ID: 3671818 • Letter: D
Question
Describe a set of operations for an ordered dictionary ADT that would correspond to the functions of the ordered map ADT. Be sure to define the meaning of the functions so that they can deal with the possibility of different entries with equal keys. Justify the correctness of each operation. And state and justify the complexity of the functions (State your assumption about the underlying implementation of the ordered dictionary while explaining complexity).
Please don't take your answer from the textbook solution here on Chegg. Their answer is totally wrong.
Explanation / Answer
To the dictionary ADT we add the following methods:
Entry first( void);