Queue
An Abstract Data Type consisting of a collection of items with operations:
- enqueue: inserting an item
- dequeue: removing the least recently inserted item (and typically returning)
Items removed in FIFO order. Items enter the queue at the rear(back) and are removed from the front.
Applications: Waiting lines, printer queues
Realizations of Queue ADT
- (circular) arrays
- linked lists