-
Notifications
You must be signed in to change notification settings - Fork 0
/
queueSLL.c
101 lines (87 loc) · 1.95 KB
/
queueSLL.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
94
95
96
97
98
99
100
101
#include <stdio.h>
#include <stdlib.h>
struct node{
int data;
struct node *link;
};
struct node *front, *rear, *new, *ptr;
struct node* createNode(){
int d;
printf("\nEnter The Data: ");
scanf("%d", &d);
struct node *temp = (struct node*)malloc(sizeof(struct node*));
temp -> data = d;
temp -> link = NULL;
return temp;
}
void enqueue(){
new = createNode();
if (front != NULL){
rear -> link = new;
rear = new;
}
else
front = rear = new;
printf("\nItem Inserted!");
}
void dequeue(){
if (front == NULL)
printf("\nQueue Empty!");
else{
if (front -> link == NULL){
printf("Dequeued Item: %d", front -> data);
front = rear = NULL;
free(front);
free(rear);
}
else{
ptr = front;
printf("Dequeued Item: %d", ptr -> data);
front = ptr -> link;
free(ptr);
}
}
}
void display(){
if (front == NULL)
printf("\nQueue Empty!");
else{
ptr = front;
printf("\nQueue Data: \n");
while(ptr != NULL){
printf("%d\t", ptr -> data);
ptr = ptr -> link;
}
}
}
void main(){
int menuFlag = 1;
while (menuFlag == 1){
printf("\n\t\t ============= MENU =============");
printf("\n\t\t 1) Enqueue");
printf("\n\t\t 2) Dequeue");
printf("\n\t\t 3) Display");
printf("\n\t\t 4) Exit");
printf("\n\t\t ================================\n");
int o;
printf("\nEnter Your Option: ");
scanf("%d", &o);
switch(o){
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
printf("\nClosing...\n");
menuFlag = 0;
break;
default:
printf("\nPlease Enter A Valid Option!\n");
}
}
}