Queues

A queue is a list that operates under the principle "first in, first out" (FIFO).
- New elements are enqueued into the queue.
- Old elements are dequeued from the queue.
- To enforce the FIFO principle, we enqueue and dequeue at opposite ends.
Implement a queue as a subclass of a list class.
- Use PushFront() and PopBack(), or
- Use PushBack() and PopFront().
- Choose a list class for which enqueuing and dequeuing will be efficient.
Use private inheritance
- This prevents violations of the FIFO principle.
- The queue class has access to all public and protected list functions.
- The queue class user has access only to the queue functions.

This page was last modified on Mar 28, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/Queues.html