DSA/stackusinglinkedlist.cpp at master · thesakshimane/DSA · 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
#include <iostream>

using namespace std;

struct node
{
    int data;
    node *link;
};

class Stack
{
    node *head;

public:
    Stack() { head = NULL; }
    void push(int x)
    {
        node *nn = new node;

        if (nn == NULL)
        {
            cout << "Stack full" << endl;
            exit(0);
        }
        nn->data = x;
        nn->link = head;
        head = nn;
    }

    int pop()
    {
        if (is_empty())
        {
            cout << "Stack empty. " << endl;
            exit(0);
        }
        node *temp = head;
        int x = head->data;
        head = head->link;
        delete temp;
        return x;
    }

    void display()
    {

    }

    int is_empty()
    {
        if (head == NULL)
        {
            return 1;
        }
        else
        {
            return 0;
        }
    }
};

int main()
{
    Stack S1;
    S1.push(5);
    S1.pop();
}