Data-Structures-and-Algorithms-/Queue_LL.cpp at master · ItsOnkar-dev/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
113
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include<iostream>

using namespace std;

class node{
	public:
	int data;
	node *next;
};

node *front=NULL;
node *rear=NULL;

void traverse()
{
	node *temp=front;

	if(front==NULL && rear==NULL)
    {
	cout<<"underflow";
    }
	else
	{
		while(temp!=NULL)
		{
		cout<<temp->data<<" ";
		temp=temp->next;
		}
	}
}

void enqueue(int val)
{
	node *p=new node;
	p->data =val;
	p->next=NULL;
	if(front==NULL && rear==NULL)
	{
	front=p;
	rear=p;
	}
	else
	{
	rear->next=p;
	rear=p;

	}
}


void dequeue()
{
	node *temp=front;

	if(front==NULL && rear==NULL)
	{
	cout<<"underflow";
	}
	else if(front==rear)
	{
		cout<<"Deleted value is: "<<front->data<<endl;
		front=NULL;
		rear=NULL;
		delete(temp);
	}
	else
	{
	cout<<"\ndeleted value is: "<<front->data;
	front=front->next;
	delete(temp);
	cout<<"\nAfter Deletion: ";
	}
}


int main()
{

enqueue(8);
enqueue(6);
traverse();
cout<<endl;

enqueue(4);
traverse();
cout<<endl;

enqueue(10);
enqueue(12);
traverse();
cout<<endl;

dequeue();
traverse();
cout<<endl;

dequeue();
traverse();
cout<<endl;

dequeue();
traverse();
cout<<endl;

}