Chapter Summary (cont.)

  1. Stacks, queue, and priority queues are adapters built on top of the fundamental collections. A stack enforces the LIFO protocol, while the queue uses FIFO.
  2. A set maintains elements in order. Permits very efficient insertion, removal, and testing of elements.
  3. A map is a keyed container. Entries in a map are accessed through a key, which can be any ordered data type. Associated with each key is a value. A multimap allows more than one value to be associated with a key.
  4. A priority queue is a collection organised so as to permit fast access to and removal of the largest element.
prev |top