A queue is an abstract data type that serves as a collection of elements, with two principal operations: enqueue, which adds an element to the collection, and dequeue, which removes the most recently added element that was not yet removed. The order in which elements are treated are FIFO (for First in, first out).
The below UI example would help in visualizing the Queue operations i.e enqueue,dequeue, top and tail. The queue is based on LinkedLists.
| Enqueue | |||||||||||
| Dequeue | |||||||||||
| Top | |||||||||||
| Tail | |||||||||||
| Status | |||||||||||
| Runtime Complexity |
|