-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmainMenu.c
More file actions
240 lines (212 loc) · 4 KB
/
mainMenu.c
File metadata and controls
240 lines (212 loc) · 4 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
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
#include <stdio.h> /*Has the Standard Input and Output Functions */
#include <stdlib.h> /*Has the Malloc Function*/
/*Node Structure*/
struct Node
{
int data;
struct Node *link;
};
/*Listing the Functions*/
/*For User*/
void menu();
int choice();
/*Essential and For Efficient use*/
int isNull(struct Node *head);
int countNodes(struct Node *head);
/*Display Function*/
void display(struct Node *head);
/*Insert Functions*/
void insertEnd(struct Node **head, int data);
void insertStart(struct Node **head, int data);
void insertNth(struct Node **head, int data, int place);
/*Delete Functions*/
void deleteEnd(struct Node *head);
struct Node *deleteStart(struct Node *head);
void deleteNth(struct Node **head, int place);
/*Main Entry Point of the Program*/
int main()
{
struct Node *head = NULL;
// Insert elements at the end
printf("Inserting at the end:\n");
insertEnd(&head, 10);
insertEnd(&head, 20);
insertEnd(&head, 30);
insertEnd(&head, 40);
display(head);
printf("\n");
// Insert element at the start
printf("Inserting at the start:\n");
insertStart(&head, 5);
display(head);
printf("\n");
// Insert element at position 3
printf("Inserting at position 3:\n");
insertNth(&head, 25, 3);
display(head);
printf("\n");
// Display total number of nodes
printf("Total number of nodes: %d\n", countNodes(head));
// Delete element from the end
printf("Deleting from the end:\n");
deleteEnd(head);
display(head);
printf("\n");
// Delete element from the start
printf("Deleting from the start:\n");
head = deleteStart(head);
display(head);
printf("\n");
// Delete element at position 3
printf("Deleting from position 3:\n");
deleteNth(&head, 3); // Data is not necessary here for deletion
display(head);
printf("\n");
// Display total number of nodes again
printf("Total number of nodes after deletion: %d\n", countNodes(head));
}
int isNull(struct Node *head)
{
return (head == NULL);
}
int countNodes(struct Node *head)
{
int count = 0;
struct Node *temp = head;
if (isNull(head))
{
printf("LIST IS EMPTY");
}
else
{
while (temp != NULL)
{
count++;
temp = temp->link;
}
}
return count;
}
void display(struct Node *head)
{
struct Node *temp = head;
if (isNull(head))
{
printf("LIST IS EMPTY");
}
else
{
while (temp != NULL)
{
printf("%d -> ", temp->data);
temp = temp->link;
}
printf("NULL!");
}
}
void insertEnd(struct Node **head, int data)
{
struct Node *temp = *head;
struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
newNode->data = data;
newNode->link = NULL;
if (isNull(*head))
{
*head = newNode;
}
else
{
while (temp->link != NULL)
{
temp = temp->link;
}
temp->link = newNode;
}
}
void insertStart(struct Node **head, int data)
{
struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));
ptr->data = data;
ptr->link = *head;
*head = ptr;
}
void insertNth(struct Node **head, int data, int place)
{
if (isNull(*head))
{
printf("LIST IS EMPTY");
}
else
{
struct Node *temp = *head;
struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));
ptr->data = data;
ptr->link = NULL;
while (place != 2)
{
temp = temp->link;
place--;
}
ptr->link = temp->link;
temp->link = ptr;
}
}
void deleteEnd(struct Node *head)
{
if (isNull(head))
{
printf("LIST IS EMPTY");
}
else
{
struct Node *temp = head;
while (temp->link->link != NULL)
{
temp = temp->link;
}
free(temp->link);
temp->link = NULL;
}
}
struct Node *deleteStart(struct Node *head)
{
if (isNull(head))
{
printf("LIST IS EMPTY");
}
else
{
struct Node *temp = head;
head = head->link;
free(temp);
temp = NULL;
}
return head;
}
void deleteNth(struct Node **head, int place)
{
struct Node *prev = *head, *cur = *head;
if (isNull(*head))
{
printf("LIST IS EMPTY");
}
else if (place == 1)
{
*head = cur->link;
free(cur);
cur = NULL;
prev = NULL;
}
else
{
while (place != 1)
{
prev = cur;
cur = cur->link;
place--;
}
prev->link = cur->link;
free(cur);
cur = NULL;
}
}