-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.c
83 lines (76 loc) · 1.45 KB
/
queue.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
#include <stdio.h>
#include <stdlib.h>
typedef struct node{
int data;
struct node *next;
}NODE;
NODE* getNode(int data);
void addLast(NODE **head, int data);
void enqueue(NODE **head, int data);
void dequeue(NODE **head);
void traverseForward(NODE *head);
int main(){
NODE *head=NULL;
traverseForward(head);
enqueue(&head,10);
traverseForward(head);
enqueue(&head,20);
traverseForward(head);
dequeue(&head);
traverseForward(head);
enqueue(&head,30);
traverseForward(head);
enqueue(&head,40);
traverseForward(head);
dequeue(&head);
traverseForward(head);
dequeue(&head);
traverseForward(head);
return 0;
}
NODE* getNode(int data){
NODE *newNode=(NODE*) malloc(1*sizeof(NODE));
newNode->data=data;
newNode->next=NULL;
return newNode;
}
void enqueue(NODE **head, int data){
addLast(head,data);
}
void dequeue(NODE **head){
NODE *tmp;
if(*head==NULL){
printf("Queue is empty\n");
}else{
printf("deleted element: %d\n",(*head)->data);
tmp = *head;
*head = (*head)->next;
free(tmp);
}
}
void addLast(NODE **head, int data){
NODE *tmp;
NODE *newNode=getNode(data);
if(newNode == NULL){
printf("full!");
return;
}
if(*head==NULL){
*head=newNode;
}
else{
tmp = *head;
while(tmp->next!=NULL){
tmp = tmp->next;
}
tmp->next = newNode;
}
}
void traverseForward(NODE *head){
NODE *tmp=head;
while(tmp!=NULL){
printf("%d ",tmp->data);
tmp = tmp->next;
}
printf("\n");
}