DS/stack_linked_list.cpp at master · ashok2811/DS · 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
#include <bits/stdc++.h>
using namespace std;

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

Node* top = NULL;

void Push (int x) {
    Node* temp1 = new Node();
	temp1 -> data = x;
	temp1 -> link = top;
    top = temp1;
}

void Pop() {
    Node* temp;
    if(top == NULL){
        cout << "Stack is Empty" <<endl;
        return;
    }

    temp = top;
    top = top->link;
    delete(temp);

}

void Top(){
    Node* temp = top;
    if (top == NULL){
        cout << "Empty Stack"<< endl;
        return;}
    cout << temp -> data << endl;

}

void Print() {
	Node* temp = top;
	cout << ("Stack : ");
	while(temp != NULL){

		cout << temp -> data << " ";
		temp = temp -> link;
	}

	cout << endl;
}


int main() {
for (int i = 0; i < 20; i++)
    {
        Push(i); Print();
    }

    Top();


    return 0;
}