A queue is a container of objects. The queue items inserted and removed based on first-in-first-out (FIFO) principle. The addition of entities to the rear terminal position, known as enqueue. Removal of entities from the front terminal position, known as dequeue.
Queue implemented in many places in real word applications. Example wait in the queue to collect the tickets, get enter pass, toll roads collects fees and more. The image shows, a sequence of people awaiting their turn to be attended to proceed.
The queue can be implemented using Linked list and dynamic array. Queue section explains how to implement the Queue and various application related problems which use Queue operation.
|23 Queue implementation || Queue data Structure used to store the objects in First in first out principle (FIFO). Queue implemented using the array or collection classes. |
|24 Circular Queue || The circular queue is a queue which the last node connected back to the first node to make a circle. front and rear pointers point to the beginning of the array. |
|25 Double-ended queue (DeQueue) || The double ended queue is a queue for which elements can be added or removed both ends. It supports Insert an item from front or rear and delete the item from from or rear. |
|26 Priority Queue || A priority queue is a container with each element has a priority associated with it. The priority queue inserts the item base on priority and remove the highest priority from the priority queue. |
|27 Queue using Linked list || Write a program to implement queue data Structure using linked list. |
|28 Queue Palindrome || Write a program to check palindrome string using queue data structure. |
|29 Queue Using Stack || Write a program to check palindrome string using Stack data structure. |
|30 Queue Maximum || Write a program to retrieve the maximum and minimum element from a queue |