In the previous chapter, we introduced queues and lists. We presented several specialized types of queues and their applications.
A map is a function that converts (maps) some key to a value in a key-value pair. The key and value may be of any type. A hash table is an unordered collection of key-value pairs where each key is distinct (no duplicate keys). Values are not required to be distinct, so two or more keys may map to the same value. Hash tables support very fast access to information accessed through ...
