Beginners-Data-Structure/Stack/reverseStack.cpp at main · akibzaman/Beginners-Data-Structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<bits/stdc++.h>
#include"MYSTACK.h"

using namespace std;

void insertAtBottom(Stack<int>&chk, int chkElement){

    if(chk.empty()){
        chk.push(chkElement);
        return;
    }

    int topElement = chk.Top();
    chk.pop();
    insertAtBottom(chk,chkElement);

    chk.push(topElement);
}

void reverseStack (Stack<int> &chk){

    if(chk.empty()){
        return;
    }

    int topElement=chk.Top();
    chk.pop();
    reverseStack(chk);
    insertAtBottom(chk,topElement);


}

int main(){

    Stack<int>st;
    st.push(1);
    st.push(2);
    st.push(3);
    st.push(4);
    st.push(5);

    reverseStack(st);

    while(!st.empty()){
        cout << st.pop() << endl;
    }

    return 0;
}