Data-Structure/stack_LinkedList.cpp at master · DeekshaKodieur/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
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
#include<iostream>

using namespace std;

struct node
{
    int info;
    node* next;
};

node* top=NULL;
void push(int data);
void pop();
void display();
int size=0;

bool isempty()
{
    if(top== NULL)
    {
        return true;
    }
    else
        return false;
}

int main()
{
    bool t = true;
    while (t)
    {
        cout<<"Inserting the node   : Press 1 "<<endl;
        cout<<"Deleting the node    : Press 2 "<<endl;
        cout<<"exit                 : Press 3 "<<endl;
        cout<<endl;

        int option;
        cout<<"Enter the choice from the above options : ";
        cin>>option;
        cout<<endl;

        switch(option)
        {
            case 1 :
                    cout<<"Insertion : " <<endl;
                    int x;
                    cout<<"Enter the value to be inserted : ";
                    cin>>x;
                    cout<<endl;
                    push(x);
                    display();

                break;

            case 2 :
                    cout<<"Deletion : " <<endl;
                    cout<<endl;
                    pop();
                    display();

                break;

            case 3 :
                    t = false;

                break;

           default : cout<<"Invalid choice ! "<<endl;
                     cout<<endl;
                break;


        }

    }
    return 0;
}

void push(int data)
{
    node* ptr;
    ptr=new node();
    ptr->info=data;
    ptr->next=top;
    top=ptr;
    size++;
}


void pop()
{
    if(isempty())
    {
        cout<<"Stack is empty "<<endl;
        cout<<endl;
    }
    else
    {
        node* ptr;
        ptr=top;
        top=top->next;
        delete(ptr);
        size--;
    }
}

void display()
{
    if(size==0)
    {
        cout<<"Stack is empty "<<endl;
        cout<<endl;
    }

    else
    {
        node* ptr;
        ptr=top;
        cout<<"Stack is : ";
        while(ptr!=NULL)
        {
            cout<<ptr->info <<" ";
            ptr=ptr->next;
        }
        cout<<endl;
        cout<<endl;

        cout<<"Element at the top : ";
        cout<<top->info<<endl;
        cout<<endl;
    }


}