queues queues are an essential data structure that are found in vast amounts of software from user mode to kernel mode applications that are core to the system fundamentally they honour first in first out (fifostrategythat is the item first put into the queue will be the first servedthe second item added to the queue will be the second to be served and so on traditional queue only allows you to access the item at the front of the queuewhen you add an item to the queue that item is placed at the back of the queue historically queues always have the following three core methodsenqueueplaces an item at the back of the queuedequeueretrieves the item at the front of the queueand removes it from the queuepeek retrieves the item at the front of the queue without removing it from the queue as an example to demonstrate the behaviour of queue we will walk through scenario whereby we invoke each of the previously mentioned methods observing the mutations upon the queue data structure the following list describes the operations performed upon the queue in figure enqueue( enqueue( enqueue( enqueue( enqueue( dequeue( peek( this operation is sometimes referred to as front