Peek()<\/strong>: This operation is used to get the value of the element from the front of the queue.<\/li>\n<\/ul>\nFor reversing the queue, we will use the concept of recursion. The approach will firstly remove the front element from the queue and recursively call the reverse function for the remaining queue. By following this, we are dividing the larger problem into smaller sub-problems.<\/p>\n
Example:<\/strong>
\nInput: Q = [15, 25, 3, 44, 55]
\nOutput: Q = [55, 44, 3, 25, 15]
\nExplanation: Output queue is the reverse version of input queue.<\/p>\nRecursive Algorithm<\/h3>\n\n- Pop an element from the queue if the queue has elements otherwise return an empty queue.<\/li>\n
- Call the revQueue function for the remaining queue.<\/li>\n
- At last, Push the popped element in the resultant reversed queue.<\/li>\n<\/ol>\n
Pseudo Code:<\/h4>\nqueue revQueue(queue)\n{\n if (queue is empty)\n return queue;\n else {\n data = queue.front()\n queue.pop()\n queue = revQueue(queue);\n q.push(data);\n return queue;\n }\n}<\/code><\/pre>\n\t\t\t\t\t\t
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657608048706-Article.jpg\")
<\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606562207-Image-01.png\")
<\/p>\n