reverseStackUsingDoubleLinkedlist/first.cpp at main · spscbd/reverseStackUsingDoubleLinkedlist · 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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include<bits/stdc++.h>
using namespace std;

class node
{
public:

    int data;

    node* nxt;

    node* prev;

};

class doublelink
{
public:

    node* head;
    int sz=0;

    doublelink()
    {
        head=NULL;
    }

    node* create(int val)
    {
        node* a=new node;

        a->data=val;
        a->nxt=NULL;
        a->prev=NULL;

        return a;


    }

    void push(int val)
    {
        sz++;
        node* a=create(val);

        if(head==NULL)
        {
            head=a;
            return;
        }

        node* b=head;

        b->prev=a;
        a->nxt=b;
        head=a;
    }

    void pop()
    {

        if(head==NULL)
        {
            return;
        }

        node* b=head;

        head=b->nxt;

        delete b;
        sz--;

    }

    int getsize()
    {
        return sz;
    }

    int top()
    {

        return head->data;
    }

    void allelements()
    {
        node*a=head;

        while(a!=NULL)
        {
            cout<<a->data<<endl;

            a=a->nxt;


        }
    }


};

int main()
{
    doublelink st;
    doublelink temp;

    st.push(5);
    st.push(6);
    st.push(7);

    while(st.getsize()>0)
    {
        temp.push(st.top());

        st.pop();
    }

//    cout<<st.getsize();
//    cout<<endl;
//    st.top();
//
//    st.pop();
//
//    cout<<"After pop "
//            <<endl;


    //cout<<endl;

    swap(st,temp);


    st.allelements();


}