Question

C++ Data structures and Algorithms

Use a Queue to reverse a stack in place. Assume you are given a stack of string values like Stack s; using a Queue, cause all of the items in the stack to be reversed. For example, if you have the following contents on the stack s Top --- bird cat dog turtle ----- Bottom After you run your code, you stack contents should look like Top --- turtle dog cat bird ----- Bottom

Answer 1

//please like and comment

//Main.cpp

#include<iostream>
#include<stack>
#include<queue>
#include<string>
using namespace std;

void main()
{
   stack<string> stackObj;

   //stack elements are top-"bird cat dog turtle - bottom
   stackObj.push("turtle");
   stackObj.push("dog");
   stackObj.push("cat");
   stackObj.push("bird");  

   queue<string> queueObj;
  
   //queue elements
   //front - bird cat dog turtle-back
   while (!stackObj.empty())
   {
       queueObj.push( stackObj.top());
       stackObj.pop();
   }

   //get the queue elements and push back to the stack
   //stack top - turtle dog cat bird - bottom
   while (!queueObj.empty())
   {
       stackObj.push(queueObj.front());
       queueObj.pop();
   }

   //pop the stack elements to display the results
   while (!stackObj.empty())
   {
       cout << stackObj.top() << endl;
       stackObj.pop();
   }  
}

//output