I have just published a program that shows examples of a queue data structure.
This page shows examples of the Queue Data Structure.
Queues operate under a property of First in First Out (FIFO), which is similar to waiting in a line.
The two main operations in a queue are to Enqueue (or insert an element) and Dequeue (or remove an element). Just like waiting in line, when an element is enqueued it is inserted at the back of the queue. And also like waiting in line, when an element is removed from a queue, it is removed from the front of the line.