![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657608159188-Article.jpg\")
<\/p>\n<\/p>\n
In this article, we’ll look at how to reverse a queue. We must reverse a queue with only standard operations:<\/p>\n
Before we get there, let’s go over some fundamental queue data structure concepts.<\/p>\n
Queue follows the principle of FIFO (First in First out) i.e. element which is inserted first will be removed first. The operation for insertion of elements<\/a> is known as enqueue operation and the operation for deletion of elements is known as dequeue operation. Like Stack, Queue is also a linear data structure.<\/a><\/p>\n Examples:<\/strong> Output 1:<\/strong><\/p>\n Input 2:<\/strong><\/p>\n Output 2:<\/strong><\/p>\n One method for reversing the queue is to store the queue elements in a stack so that when we re-insert the queue elements, they are inserted in reverse order. We use stack because it has the ‘LIFO’ property, which means that the last element inserted into the data structure should be the first element of the reversed queue. This problem is solved using a stack. It will be a two-step process:<\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606447300-Image-02.png\")
<\/p>\n
\nInput 1:<\/strong><\/p>\nQueue = [11, 22, 33, 44, 55]<\/code><\/pre>\nQueue = [55, 44, 33, 22, 11]<\/code><\/pre>\nQueue = [12, 24, 36, 48]<\/code><\/pre>\nQueue = [48, 36, 24, 12]<\/code><\/pre>\nApproach 1: Reverse a Queue<\/h2>\n
\n
Code Implementation<\/h3>\n\t\t\t\t\t\t