* Function to display elements of Queue */ } /* Q has only one element, so we reset the queue after deleting it. Queue Implementations in Python, Java, C, and C++ for the last element, reset the values of FRONT and REAR to -1.add the new element in the position pointed to by REAR.for the first element, set the value of FRONT to 0.initially, set value of FRONT and REAR to -1.REAR track the last element of the queue.FRONT track the first element of the queue.Peek: Get the value of the front of the queue without removing it.Dequeue: Remove an element from the front of the queue.Enqueue: Add an element to the end of the queue.We can implement the queue in any programming language like C, C++, Java, Python or C#, but the specification is pretty much the same.Ī queue is an object (an abstract data structure - ADT) that allows the following operations: In programming terms, putting items in the queue is called enqueue, and removing items from the queue is called dequeue. In the above image, since 1 was kept in the queue before 2, it is the first to be removed from the queue as well. Queue follows the First In First Out (FIFO) rule - the item that goes in first is the item that comes out first. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who gets the ticket.

Decrease Key and Delete Node Operations on a Fibonacci HeapĪ queue is a useful data structure in programming.

Enqueue in python