Definition

A “First In First Out” (FIFO) collection (ADT) of items.

Queue Operations:

• Enqueue
  • Add a new item to the queue
• Dequeue
  • Remove the “oldest” item from the queue
• Is_empty
  • Indicate whether or not there are items still on the queue

Example

An implementation with Linked List

implement with a circular array