-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathqueue_linkedlist.c
117 lines (102 loc) · 2.1 KB
/
queue_linkedlist.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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define QUEUE_SIZE 5
struct node {
int val;
struct node *next;
};
struct node *findex = NULL;
struct node *rrindex = NULL;
bool isqueuefull(struct node *fnode)
{
int cnt=0;
bool ret = false;
while(fnode!=NULL)
{
fnode=fnode->next;
cnt++;
}
if(cnt>=QUEUE_SIZE)
{
printf("Queue is Full\n");
ret= true;
}
return ret;
}
bool isqueueempty(struct node *fnode)
{
bool ret = false;
if(fnode==NULL)
{
printf("Queue is Empty\n");
ret= true;
}
return ret;
}
void displayqueue(struct node *fnode)
{
printf("Queue Value= ");
while(fnode !=NULL)
{
printf("%d ", fnode->val);
fnode=fnode->next;
}
}
void enqueue(struct node **rnode, int val)
{
struct node *newnode = (struct node *) malloc(sizeof(struct node));
newnode->val= val;
newnode->next =NULL;
if(findex==NULL)
{
findex=newnode;
*rnode=newnode;
}
else
{
(*rnode)->next=newnode;
*rnode = newnode;
}
}
void dequeue(struct node **fnode, int *val)
{
struct node *tempnode;
*val = (*fnode)->val;
tempnode = *fnode;
*fnode = (*fnode)->next;
free(tempnode);
}
void main(void)
{
int input, val;
while(1)
{
printf("\n\n1. Enqueue\n2. Dequeue\n3. Display Queue\nChoice- ");
scanf("%d",&input);
switch (input)
{
case 1:
if(!isqueuefull(findex))
{
printf("Enter Value= ");
scanf("%d", &val);
enqueue(&rrindex, val);
}
break;
case 2:
if(!isqueueempty(findex))
{
dequeue(&findex,&val);
printf("\nValue= %d\n",val);
}
break;
case 3:
if(!isqueueempty(findex))
displayqueue(findex);
break;
default:
printf("Invalid Input\n");
}
}
}