Data-structures-and-Algorithms/stack_using_linked_list.cpp at master · mudit-chopra/Data-structures-and-Algorithms · 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
 #include<iostream>
using namespace std;

template <typename T>

class Node{
	public:
		T data;
		Node<T>*next;

		Node(T data){
			this->data = data;
			this->next = NULL;
		}

};

template <typename T>


class Stack{

	Node<T>*head;

	int size;
	public:

		Stack(){
			head =NULL;
			size=0;
		}


		void push(T element){

			Node <T>*newNode = new Node<T>(element);

			newNode->next=head;
			head = newNode;

			size++;
		}


		bool isEmpty(){
			return size==0;
		}


		T top(){
			if(isEmpty()){
				cout<<"Stack is empty"<<endl;
				return 0;
			}
			else
				return head->data;
		}


		T pop(){
			if(isEmpty()){
				cout<<"Stack is empty"<<endl;
				return 0;
			}
			else{
				T temp = head->data;
				Node<T> *temp1 = head;
				head = head->next;
				delete temp1;
				size--;
				return temp;

			}

		}


		int getSize(){
			return size;
		}


};


int main()
{

	Stack<int> s;

	s.push(10);
	s.push(20);
	s.push(30);
	s.push(40);
	s.push(50);


	cout<<s.top()<<endl;


	cout<<s.pop()<<endl;
	cout<<s.pop()<<endl;
	cout<<s.pop()<<endl;


	cout<<s.getSize()<<endl;


	cout<<s.isEmpty()<<endl;

	return 0;
}