-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueue_using_Linked_List.c
93 lines (85 loc) · 2.21 KB
/
Queue_using_Linked_List.c
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
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct Node {
int data;
struct Node* next;
} *newnode, *front = NULL, *rear = NULL, *temp = NULL;
struct Node* createNode(int info) {
struct Node *newnode = (struct Node*)malloc(sizeof(struct Node));
newnode -> data = info;
newnode -> next = NULL;
return newnode;
}
void Enqueue(int info) {
newnode = createNode(info);
if(front == NULL && rear == NULL)
front = rear = newnode;
else {
rear -> next = newnode;
rear = newnode;
}
}
void Dequeue() {
if(front == NULL)
printf("\nQueue is Empty!");
else {
temp = front;
front = front -> next;
printf("\nElement popped : %d", temp -> data);
free(temp);
}
}
void QueueFront() {
if(front == NULL)
printf("\nQueue is Empty!");
else
printf("\nFront of the Queue is : %d", front -> data);
}
void QueueRear() {
if(front == NULL)
printf("\nQueue is Empty!");
else
printf("\nRear of the Queue is : %d", rear -> data);
}
void Display() {
if(front == NULL)
printf("\nQueue is Empty!");
else {
temp = front;
printf("\n");
while(temp != NULL) {
printf("%d <-- ", temp -> data);
temp = temp -> next;
}
}
}
int main()
{
int choice, data;
do{
printf("\nEnter choice\n1. Enqueue\n2. Dequeue\n3. Front of Queue\n4. Rear of Queue\n5. Display\n6. Exit\n");
scanf("%d", &choice);
switch(choice) {
case 1: printf("Enter data : ");
scanf("%d", &data);
Enqueue(data);
Display();
break;
case 2: Dequeue();
Display();
break;
case 3: QueueFront();
break;
case 4: QueueRear();
break;
case 5: Display();
break;
case 6: exit(0);
break;
default:printf("\nEnter a valid choice!");
}
}
while(choice != 6);
return 0;
}