-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathdsassign4_17.c
120 lines (114 loc) · 2.17 KB
/
dsassign4_17.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
118
119
120
#include <stdio.h>
#include <stdlib.h>
// Anirudh Sharma 2K20/SE/17
struct Node
{
int num;
struct Node *next;
} * front, *newptr, *rear;
struct Node *new_node()
{
newptr = (struct Node *)malloc(sizeof(struct Node));
int val;
printf("Enter the value: ");
scanf("%d", &val);
newptr->num = val;
newptr->next = NULL;
return newptr;
};
void Insert();
void Display();
void Del_Node();
// Driver Code
int main()
{
front = rear = NULL;
int ch;
char c;
do
{
printf("Menu\n");
printf("-------------------\n");
printf("1. Push\n");
printf("2. Pop\n");
printf("3. Display\n");
printf("Enter your Choice :- ");
scanf("%d", &ch);
switch (ch)
{
case 1:
{
Insert();
break;
}
case 2:
{
Del_Node();
break;
}
case 3:
{
Display();
break;
}
default:
{
printf("ERROR\n");
break;
}
}
printf("Do you want to continue(Y/N)\n");
scanf(" %c", &c);
} while (c == 'Y' || c == 'y');
}
void Insert()
{
struct Node *np = new_node();
if (rear == NULL)
{
front = rear = np;
}
else
{
rear->next = np;
rear = np;
}
}
void Del_Node()
{
if (front == NULL)
{
printf("Queue underflow\n");
}
else
{
struct Node *np = front;
int n = front->num;
if (front == rear)
{
front = rear = NULL;
}
else
{
front = front->next;
}
free(np);
printf("Deleted element %d\n", n);
}
}
void Display()
{
struct Node *np = front;
if (!np)
{
printf("Empty queue\n");
return;
}
printf("Data\n");
while (np != NULL)
{
printf("%d ", np->num);
np = np->next;
}
printf("\n");
}