Example: Queue Abstract Data Type

A waiting line is also called a queue.

• Queue
  • FIFO; First in, first out
  • Enqueue; Put items in queue one at a time
  • Dequeue; Remove items from queue one at a time
• Queue ADT
  • Implementation hidden from clients; Clients may not manipulate data structure directly
  • Only queue member functions can access internal data
  • Queue ADT (Chapter 15)
  • Standard library queue class (Chapter 20)

The queue ADT guarantees the integrity of its internal data structure. Clients may not manipulate this data structure directly. Only the queue member functions have access to its internal data.