![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656308896901-Article.jpg\")
<\/p>\n<\/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.
\nFor Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656308918940-Image-01.png\")
<\/p>\n
Enqueue:<\/strong> This function is used to add an element to the rear end of the queue. If the queue is completely filled, then it will be in an overflow condition. The time complexity of the enqueue is O(1).<\/p>\n<\/li>\n Dequeue:<\/strong> This function is used to remove an element from the front end of the queue. If the queue is empty, then it will be in an underflow condition. The time complexity of the dequeue is O(1).<\/p>\n<\/li>\n Front:<\/strong> This function returns the front element of the queue. The time complexity of this function is O(1).<\/p>\n<\/li>\n Rear:<\/strong> This function returns the last element of the queue. The time complexity of this function is O(1).<\/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 Simple Queue:<\/strong> In Simple queue, insertion of the element takes place at the rear end i.e. ENQUEUE and removal of the element takes place at the front end i.e. DEQUEUE. Simple queue is also called a linear queue.<\/p>\n<\/li>\n Circular Queue:<\/strong> In a circular queue, the elements act like a circular ring. The working of a circular queue is similar to a simple queue but in a circular queue the element in the last position is connected to the element in the first position. The main advantage of a circular queue is that the memory will be utilized in a better way.<\/p>\n<\/li>\n Priority Queue:<\/strong> In a priority queue, the elements are stored according to their priority, Based on the priority of elements we\u2019ll set our queue accordingly i.e. in ascending order or in descending order.<\/p>\n<\/li>\n Dequeue:<\/strong> Dequeue is known as double ended queue. In dequeue, the elements can be inserted or removed from both of the ends. For the implementation of queue, we need to initialize two pointers i.e. front and rear, we insert an element from the rear and remove the element from the front, and if we increment the rear and front pointer we may occur error,Types of queues:<\/h3>\n
\n
\nDue to this property, dequeue may not follow the first in first out property.<\/p>\n<\/li>\n<\/ul>\nQueue implementation using Array:<\/h3>\n
\nDue to which the front pointer may reach the end.
\nThe solution of the above problem is to increase the front and rear pointer in a circular manner.<\/p>\nEnqueue Operation \/ Insertion:<\/h3>\n
\n
Dequeue Operation \/ Remove:<\/h3>\n
\n