Queues

From MMAE

Queues are a First In First Out (FIFO) data structure. The first item to be inserted into the queue is also the first one to come out. This is similar to the way waiting in line works. Because Queues are FIFO there needs to be two pointers, one for the front of the queue and one for the rear of it.

[edit] Functions

• Enqueue
• Dequeue