DSA-CP-/Stack_using_linkedlist.cpp at main · jatin-code21/DSA-CP- · 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
#include <bits/stdc++.h>
using namespace std;

class Node
{
public:
    int data;
    Node *next;
} *top = NULL;

void push()
{
    int val;
    Node *temp = new Node;
    if (temp == NULL)
    {
        cout << "Stack is full" << endl;
    }
    else
    {
        cout << "Push data: ";
        cin >> val;
        temp->data = val;
        temp->next = top;
        top = temp;
    }
}

void pop()
{
    Node *ptr = top;
    cout << ptr->data << " is removed" << endl;
    top = top->next;
    delete (ptr);
}

void display()
{
    Node *p = top;
    while (p != NULL)
    {
        cout << p->data << " " << endl;
        p = p->next;
    }
}

int main()
{

    int ch;
    do
    {
        cout << "1) Push\n2) Pop\n3) Display\n4) Peek\n5) Empty" << endl;
        cout << "Enter the choice you want to perform:";
        cin >> ch;

        switch (ch)
        {
        case 1:
            push();
            break;

        case 2:
            pop();
            break;

        case 3:
            display();
            break;

            // case 4:
            //     s.peek();
            //     break;

            // case 5:
            //     s.isEmpty();
            //     break;
        }

    } while (ch != 6);
}