-
Notifications
You must be signed in to change notification settings - Fork 17
/
QueueLL.c
66 lines (60 loc) · 1 KB
/
QueueLL.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
/*
* Author : Fakhra Najm.
* EMail : fnajm09@gmail.com.
Implementation of queue using linkedList.
* 1. enqueue
* 2. dequeue
* 3. printQ
*/
#include<stdio.h>
#include<stdlib.h>
struct Node{
int data;
struct Node *next;
}*front = NULL, *rear = NULL;
void enqueue(int value){
struct Node *queue = (struct Node *)malloc(sizeof(struct Node));
if(queue == NULL)
printf("queue is full\n");
else{
queue->data = value;
queue->next = NULL;
if(front == NULL){
front = rear = queue;
}
else{
rear->next = queue;
rear = queue;
}
}
}
int dequeue(){
int value = -1;
if(front == NULL)
printf("queue is empty\n");
else{
struct Node *queue = front;
front = front->next;
value = queue->data;
free(queue);
}
return value;
}
void printQ(){
struct Node *node = front;
while(node){
printf("%d ",node->data );
node = node->next;
}
printf("\n");
}
int main(){
enqueue(10);
enqueue(20);
enqueue(30);
enqueue(40);
printQ();
printf("%d is deleted\n",dequeue());
printQ();
return 0;
}