forked from AllAlgorithms/cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueUsingLinkedList.cpp
More file actions
88 lines (78 loc) · 1.37 KB
/
Copy pathQueueUsingLinkedList.cpp
File metadata and controls
88 lines (78 loc) · 1.37 KB
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
#include<stdio.h>
#include <stdlib.h>
struct node {
int info;
struct node *next;
};
typedef struct node NODE;
void display(NODE *head) {
if(head == NULL){
printf("Queue is empty\n");
}
NODE *p = head;
while (p != NULL) {
printf("%d ", p->info);
p = p->next;
}
}
NODE *insertEnd(NODE *head, int y) {
NODE *q;
q = (NODE *) malloc(sizeof(NODE));
q->info = y;
q->next = NULL;
if (head == NULL) {
return q;
}
NODE *p = head;
while (p->next != NULL)
p = p->next;
p->next = q;
return head;
}
NODE *deleteStart(NODE *head) {
if (head == NULL) {
printf("Queue is empty");
return NULL;
}
NODE *p = head;
head = head->next;
printf("Delete element is: %d\n",p->info);
free(p);
return head;
}
int main() {
NODE *head=NULL;
int c = 0;
int ele, tmp;
while (1) {
system("clear");
printf("1. Insert an element in Queue.\n");
printf("2. Delete an element from Queue.\n");
printf("3. Display the elements of Queue.\n");
printf("4. Exit.\n");
printf("Enter your choice: ");
scanf("%d", &c);
switch (c) {
case 1:
printf("Enter a element to insert:");
scanf("%d",&tmp);
head=insertEnd(head,tmp);
break;
case 2:
head=deleteStart(head);
break;
case 3:
display(head);
break;
case 4:
return 0;
break;
default:
printf("Wrong choice\n");
break;
}
getchar();
getchar();
}
return 0;
}