completeDataStructureImplementation/completeStackUsingLinkedList.cpp at master · akhilagg7/completeDataStructureImplementation · 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
#include<iostream>
using namespace std;

template <typename T>
class node
{
	public:
		T data;
		node<T> *next;
		node(T d)
		{
			data=d;
			next=NULL;
		}

};

template <typename T>
class stackUsingLL{
	node<T>* head;
	int size;

	public:
		stackUsingLL()
		{
			head=NULL;
			size=0;
		}

		int getSize()
		{
			return size;
		}

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

		void push(T element)
		{
			node<T> *newnode=new node<T>(element);
			newnode->next=head;
			head=newnode;
			size++;
		}

		T top()
		{
			if(size==0)
			{
				cout<<"empty stack "<<endl;
				return 0;
			}
			return head->data;
		}

		T pop()
		{
			if(size==0)
			{
				cout<<"empty stack "<<endl;
				return 0;
			}
			int ans=head->data;
			node <T>*a=head;
			head=head->next;
			delete a;
			size--;
			return ans;
		}
};

int main()
{
//	stackUsingLL<int> s1;
//	s1.push(10);
//	s1.push(20);
//	s1.push(30);
//	s1.push(40);
//	s1.push(50);
//	cout<<s1.pop()<<endl;
//	cout<<s1.pop()<<endl;
//	cout<<s1.top()<<endl;
//	cout<<s1.getSize()<<endl;
//	cout<<s1.isEmpty()<<endl;
//	cout<<s1.pop()<<endl;
//	cout<<s1.pop()<<endl;
//	cout<<s1.top()<<endl;
//	cout<<s1.getSize()<<endl;
//	cout<<s1.isEmpty()<<endl;

//	cout<<endl;
	stackUsingLL<char> s1;
	s1.push('a');
	s1.push('b');
	s1.push('c');
	s1.push('d');
	s1.push('e');
	cout<<s1.pop()<<endl;
	cout<<s1.pop()<<endl;
	cout<<s1.top()<<endl;
	cout<<s1.getSize()<<endl;
	cout<<s1.isEmpty()<<endl;
	cout<<s1.pop()<<endl;
	cout<<s1.pop()<<endl;
	cout<<s1.top()<<endl;
	cout<<s1.getSize()<<endl;
	cout<<s1.isEmpty()<<endl;

}