-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProg10.c
297 lines (270 loc) · 7.44 KB
/
Prog10.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
/* ---------------PROBLEM STATEMENT ---------------
Implement stacks and queues using a linked list.
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
int info;
struct Node *next;
}Node;
void mainMenu();
// For stack
Node* top = NULL;
Node* head = NULL; // for keeping track of Nodes in stack
// For queues
Node* front = NULL;
Node* rear = NULL;
// --------------------------- Queues -------------------------------------
int isEmptyLL() {
if (front == NULL) return 1;
return 0;
}
void displayLL(){
if(isEmptyLL()){
printf("Queue is empty.\n");
return;
}
Node* temp = front;
while(temp != NULL){
printf("%d ",temp->info);
temp = temp->next;
}
printf("\n");
}
void EnqueueLL(){
int x;
printf("Enter the data : ");
scanf(" %d",&x);
Node* newNode = (Node*) malloc(sizeof(Node));
newNode->info = x;
newNode->next = NULL;
if(front == NULL){
front = newNode;
rear = newNode;
return;
}
rear->next = newNode;
rear = newNode;
}
void DequeueLL(){
if(front == NULL){
printf("\nUNDERFLOW!\n");
return;
}
if(front == rear){
printf("Dequeued Element : %d\n", front->info);
front = NULL;
rear = NULL;
return;
}
printf("Dequeued Element : %d\n", front->info);
Node* temp = front;
front = front->next;
free(temp);
}
// --------------------------- Stack -------------------------------------
void showStack(){
if(top == NULL){
printf("Stack is empty!\n");
return;
}
Node* temp = head;
while(temp != NULL){
printf("%d ", temp->info);
temp = temp->next;
}
printf("\n");
}
void push(){
int x;
printf("Enter the data : ");
scanf("%d", &x);
Node* newNode = (Node*) malloc(sizeof(Node));
newNode->info = x;
newNode->next = NULL;
if(top == NULL){
head = newNode;
top = newNode;
return;
}
top->next = newNode;
top = newNode;
}
void pop(){
if(top == NULL){
printf("\nUNDERFLOW !\n");
return;
}
if(top == head){
printf("Poped Element : %d\n", top->info);
head = NULL;
top = NULL;
return;
}
Node* temp = head;
while(temp->next != top){
temp = temp->next;
}
printf("Poped Element : %d\n", top->info);
temp->next = NULL;
free(top);
top = temp;
}
void peep(){
if(top == NULL){
printf("Stack is empty!\n");
return;
}
printf("\nElement at Top : %d",top->info);
}
void isEmpty(){
if(top == NULL){
printf("\nStack is empty!\n");
}
else{
printf("\nStack is NOT empty!\n");
}
}
// ------------------------- Menu of the Stack ---------------------------
void stackMenu(){
int choice;
char c;
while(1){
printf("\n************* Menu of Stack ****************\n");
printf("\nPerform operations on the stack:");
printf("\n1. Push the element\n2. Pop the element\n3. Show top element\n4. Check if stack is empty\n5. Show all elements of stack\n6. Back to Main Menu\n7. Exit");
printf("\n\nEnter the choice: ");
scanf("%d", &choice);
switch(choice){
case 1:
push();
printf("\nStack after Push operation : ");
showStack();
break;
case 2:
pop();
printf("\nStack after Pop operation : ");
showStack();
break;
case 3:
peep();
break;
case 4:
isEmpty();
break;
case 5:
printf("Elements in Stack : ");
showStack();
break;
case 6:
printf("Are you sure you want to go back to Main Menu?\n**** Remember you'll lost all your data **** (y/n): ");
scanf(" %c", &c);
if (c == 'y')
mainMenu();
else if (c == 'n')
continue;
else
printf("\nInvalid Input!\n");
break;
case 7:
printf("\nAre you sure you want to exit program? (y/n) : ");
scanf(" %c", &c);
if (c == 'y')
exit(0);
else if (c != 'n')
printf("\nInvalid Input!\n");
break;
default:
printf("Invalid choice. Please try again.\n");
}
}
}
// ------------------------------ Menu of the queue ------------------------------
void QueueMenu(){
int choice;
char c;
while(1){
printf("\n************* Menu of Queue ****************\n");
printf("\nPerform operations on the Queue:");
printf("\n1. Enqueue the element\n2. Dequeue the element\n3. Check if Queue is empty\n4. Show all elements of Queue\n5. Back to Main Menu\n6. Exit");
printf("\n\nEnter the choice: ");
scanf("%d", &choice);
switch(choice){
case 1:
EnqueueLL();
printf("\nCircular Queue after Enqueue : ");
displayLL();
break;
case 2:
DequeueLL();
printf("\nCircular Queue after Dequeue : ");
displayLL();
break;
case 3:
if(isEmptyLL()){
printf("Queue is empty\n");
}
else{
printf("Queue is not empty\n");
}
break;
case 4:
printf("Elements in Circular Queue : ");
displayLL();
break;
case 5:
printf("Are you sure you want to go back to Main Menu?\n**** Remember you'll lost all your data **** (y/n): ");
scanf(" %c", &c);
if (c == 'y')
mainMenu();
else if (c == 'n')
continue;
else
printf("\nInvalid Input!\n");
break;
case 6:
printf("\nAre you sure you want to exit program? (y/n) : ");
scanf(" %c", &c);
if (c == 'y')
exit(0);
else if (c != 'n')
printf("\nInvalid Input!\n");
break;
default:
printf("Invalid choice. Please try again.\n");
}
}
}
void mainMenu(){
int choice;
char c;
while(1){
printf("\n************* MAIN MENU ****************\n");
printf("\nChoose the Data Structure you want to work on:");
printf("\n1. Stack\n2. Queue\n3. Exit");
printf("\n\nEnter the choice: ");
scanf("%d", &choice);
switch(choice){
case 1:
stackMenu();
break;
case 2:
QueueMenu();
break;
case 3:
printf("\nAre you sure you want to exit program? (y/n) : ");
scanf(" %c", &c);
if (c == 'y')
exit(0);
else if (c != 'n')
printf("\nInvalid Input!\n");
break;
default:
printf("Invalid choice. Please try again.\n");
}
}
}
int main(){
mainMenu();
return 0;
}