Data-structures/stack-linklist.cpp at master · bilalkhann16/Data-structures · 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
#include<iostream>
using namespace std;
class node
{
    public:
        int data;
        node *previous;
        node(int val)
        {
            data=val;
            previous=NULL;
        }
};
class stack
{
    private:
        node *top;
    public:
    stack()
    {
        top=NULL;
    }
    void push(int val);
    void pop();
};
void stack::push(int val)
{
    if(top==NULL)
    {
        node *temp=new node(val);
        top=temp;
        temp=NULL;
    }
    else
    {
        node *temp=new node(val);
        temp->previous=top;
        top=temp;
        temp=NULL;
    }

}
void stack::pop()
{
    if(top==NULL)
    {
        cout<<"Underflow";
    }
    else
    {
        cout<<top->data<<endl;
        node *temp;
        temp=top;
        top=top->previous;
        temp->previous=NULL;
        delete temp;
    }

}
int main(void)
{
    stack l1;
    l1.push(1);
    l1.push(2);
    l1.push(3);
    l1.push(9);
    l1.push(10);
    l1.push(11);
    l1.pop();
    l1.pop();
    l1.pop();
    l1.pop();
    l1.pop();
    return 0;
}