Describe an efficient ordered dictionary structure for storing n elements that have an associated… 1 answer below »

Describe an efficient ordered dictionary structure for storing n elements that have an associated set of k <n keys that come from a total order. That is, the set of keys is smaller than the number of elements. Your structure should perform all the ordered dictionary operations in O(log k+ s) expected time, where s is the number of elements returned.