![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606482221-Article.jpg\")
<\/p>\n<\/p>\n
A queue is basically a linear data structure<\/a> that works on the principle of FIFO (First in First out)<\/a><\/strong> which means an element that is enqueued first will be dequeued first. Element is enqueued from the rear end of the queue and dequeued from the front end. The insertion operation in the queue is known as enqueue and the deletion operation in the queue is known as dequeue.<\/p>\n The queue is used when the operations are to be performed in the manner of First in First out order just like Breadth-First Search. Enqueue<\/strong>: This operation is used to Insert an element at the rear end of the queue.<\/p>\n<\/li>\n Dequeue<\/strong>: This operation is used to remove and return an element from the front end of the queue. <\/p>\n<\/li>\n isEmpty()<\/strong>: This operation is used to check whether the queue is empty or not. It returns bool value, if the queue is empty then this operation will return true else false.<\/p>\n<\/li>\n isFull()<\/strong>: This operation is used to check whether the queue is full or not. It return true is the queue is full, else it will return false.<\/p>\n<\/li>\n Peek()<\/strong>: This operation is used to get the value of the element from the front of the queue.<\/p>\n<\/li>\n<\/ul>\n There are 4 types of queues:<\/strong><\/p>\n 1.Simple Queue:<\/strong> <\/p>\n A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First out. In other words we can say the element that goes in first is the element that comes out first.<\/p>\n For Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.<\/p>\n In a simple queue, there are two ends, the end at which insertion operation performs is known as rear end whereas the end where deletion operation performs is known as front end.<\/p>\n 2.Circular queue:<\/strong> Circular queue is a linear data structure which follows the FIFO(First in first out) property. In this, the last element is connected to the first element to make a ring, which is also known as Ring buffer.<\/p>\n How does the Circular queue work? Operations of circular queue:<\/strong> <\/p>\n 3.Priority queue:<\/strong> Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element determines the order in which elements are removed from the priority queue. In the priority queue, all the elements are arranged either in ascending order or descending order.<\/p>\n Priority Queue Properties:<\/strong><\/p>\n Uses of priority queue:<\/strong><\/p>\n Implementation of Priority queue:<\/strong> 4.Deque (Double ended queue)<\/strong>: In Deque, The insertion and deletion operations are done from both the ends i.e. either from the rear or from the front. The representation of deque:<\/strong><\/p>\n Types of deque:<\/strong><\/p>\n Input Restricted deque<\/strong>: As the name suggests, in input restricted deque, insertion operation can be performed at only one end whereas deletion operation can be done from both the ends.<\/p>\n<\/li>\n Output Restricted deque<\/strong>: In output restricted deque, deletion operation can be performed at single end whereas insertion operation can be performed at both the ends.<\/p>\n<\/li>\n<\/ol>\n This article tried to discuss Different Types Of Queues And Its Applications<\/strong>. Hope this blog helps you understand the concept. To practice problems you can check out <\/a> at Prepbytes<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be dequeued first. Element is enqueued from the rear end of the queue and dequeued from the front end. The insertion operation in the queue is […]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[128],"tags":[],"class_list":["post-9043","post","type-post","status-publish","format-standard","hentry","category-queues"],"yoast_head":"\n
\nFor Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.
\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606562207-Image-01.png\")
<\/p>\nBasic Operations of Queue:<\/h3>\n
\n
Working of queue:<\/h3>\n
\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606631205-Image-02.png\")
<\/p>\nTypes of queues:<\/h3>\n
\nCircular queue works in the process of circular increment i.e. when we\u2019ll increment the pointer and reach the end then pointer points to the beginning of the queue.<\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606649607-Image-03.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606666865-Image-04.png\")
<\/p>\n\n
\n
\n
\nPriority queue is implemented in the following ways:<\/p>\n\n
\nWe can use deque as both stack and queue as it follows the insertion and deletion operations from both the ends.
\nWe can consider deque as both because stack follows the LIFO Order in which insertion and deletion can be done from the same end and as we study in the dequeue it is possible to do both the operations from the same end.<\/p>\n\n
Application of queues:<\/h3>\n
\n