completeDataStructureImplementation/completeQueueUsingLinkedList.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
//implemented by: Akhil Aggarwal
//contact : akhilagg123@gmail.com

#include<iostream>
using namespace std;

class node
{
	public:
		int data;
		node* next;
		node(int data)
		{
			this->data=data;
			next=NULL;
		}
};

class queue{
	node* head;
	node* tail;
	int size;

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

		int getSize()
		{
			return size;
		}

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

		void push(int element)
		{
			node *newnode=new node(element);
			if(head==NULL)
			{
				head=newnode;
				tail=newnode;
			}
			else
			{
				tail->next=newnode;
				tail=newnode;
			}
			size++;
		}

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

		int pop()
		{
			if(size==0)
			{
				cout<<"queue is empty "<<endl;
				return 0;
			}

			node *a=head;
			int ans=head->data;
			head=head->next;
			delete a;
			size--;
			return ans;
		}
};

int main()
{
	queue q;
	q.push(10);
	q.push(20);
	q.push(30);
	cout<<q.pop()<<endl;
	cout<<q.top()<<endl;
	q.push(40);
	cout<<q.pop()<<endl;
	q.push(50);
	q.push(60);
	q.push(70);
	q.push(80);
	q.push(90);
	cout<<q.top()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.isEmpty()<<endl;
	cout<<q.getSize()<<endl;
}