Introduction to Queues
The queue data structure keeps lists of elements in a manner where the first item received is the item at the front (or first item out) of the queue. This servicing scheme is called FIFO (first in-first out), and is the way we we typically expect a line to work.
In addition to constructors, the destructor, an assignment operator, etc, typically queues have the member functions enqueue() and dequeue(). Enqueue() puts element into the queue, and dequeue() takes one out.
Examples: Below is a queue (of characters) with three elements. It was create with the code:
myQueue.enqueue('g');
myQueue.enqueue('y');
myQueue.enqueue('c');
