-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue_using_linked_list.cpp
135 lines (116 loc) · 2.33 KB
/
Queue_using_linked_list.cpp
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include<iostream>
using namespace std;
struct node
{
int data;
struct node *link;
};
struct node *front = NULL;
struct node *rear = NULL;
// empty condition
/*
rear == NULL
*/
void Enqueue(int value)
{
struct node *newnode;
newnode = (struct node *)malloc(sizeof(struct node));
newnode->data = value;
newnode->link = NULL; // it store the address of the next node
if(front == NULL)
{
front = rear = newnode;
}
else
{
rear->link = newnode;
rear = newnode;
}
}
void Dequeue()
{
if(front == NULL)
{
cout<<"Queue is Empty!!"<<endl;
}
else
{
struct node *temp;
temp = front; //initializing for the traversing
cout<<"The Deleted Element is "<<temp->data<<endl;
front = temp->link;
free(temp);
}
}
void peek()
{
if(front == NULL)
{
cout<<"Queue is Empty!!"<<endl;
}
cout<<"Peek Element is "<<front->data<<endl;
}
void display()
{
if(front == NULL)
{
cout<<"Queue is Empty!!"<<endl;
}
else
{
struct node *temp;
temp = front;
while(temp != NULL)
{
cout<<temp->data<<" ";
temp= temp->link;
}
}
}
int main()
{
cout<<"\n:: Queue implementation using Linked List ::"<<endl;
int choice;
do
{
cout<<"\nEnter the choice of operation : "<<endl;
cin>>choice;
switch(choice)
{
case 1:
{
int value;
cout<<"Enter the Element to be inserted : "<<endl;
cin>>value;
Enqueue(value);
break;
}
case 2:
{
Dequeue();
break;
}
case 3:
{
peek();
break;
}
case 4:
{
display();
break;
}
case 5:
{
exit(0);
break;
}
default:
{
cout<<"Enter the Valid choice !!!"<<endl;
break;
}
}
} while (choice != 5);
return 0;
}