Assignment1 Semester2 Q4

Hi All, am trying to find da solution for this question but am kinda confuse when they say we must use two additional stacks to reverse the order elements:

below is my coding:

#include <iostream>
#include <stack>

using namespace std;

int main() {

stack<int> allint;
int num ;
num = 0;

cout<<"Enter number "<<endl;

while (num != -99)
{ cin>>num;
allint.push(num);
}


while (!allint.empty()) {
cout << allint.top() << endl;
allint.pop();
return 0;
}

Any suggestions is welcomed

Your coding is fine, the only problem is that you lose the original order. Should you require the original order of the stack again, you could reverse the reversed stack. Yet its more efficient just to access a copy of the original stack, than to call the function again to reverse the order. Hope that helps.

If you find the two stack method conceptually confusing, just step out the procedure by hand and it'll all make sense.

1
2
3

3
2
1

1
2
3

3
2
1

Thanks Guys, now I got it..