申論題

1.Among the data structures below, heaps, hashmaps, hashtables, stacks, queues, deques, and binary search trees, what is the most appropriate data structure for the following application? Give your explanations.

c. Querying the set of keys which are smaller than a given key