-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q26.cpp
153 lines (131 loc) · 3.4 KB
/
Q26.cpp
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
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node* next;
};
struct node* head;
void append(int num) {
struct node* temp = (struct node*)malloc(sizeof(struct node));
temp->data = num;
temp->next = NULL;
if (head == NULL) {
head = temp;
return;
}
struct node* right = head;
while (right->next != NULL)
right = right->next;
right->next = temp;
}
void add(int num) {
struct node* temp = (struct node*)malloc(sizeof(struct node));
temp->data = num;
temp->next = head;
head = temp;
}
void addafter(int num, int loc) {
if (loc <= 0) {
printf("Invalid location.\n");
return;
}
struct node* temp = head;
for (int i = 1; i < loc; i++) {
if (temp == NULL) {
printf("Location is out of bounds.\n");
return;
}
temp = temp->next;
}
if (temp == NULL) {
printf("Location is out of bounds.\n");
return;
}
struct node* newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = num;
newNode->next = temp->next;
temp->next = newNode;
}
int getCount() {
struct node* n = head;
int count = 0;
while (n != NULL) {
n = n->next;
count++;
}
return count;
}
void deleteNode(int num) {
struct node* temp = head;
struct node* prev = NULL;
while (temp != NULL) {
if (temp->data == num) {
if (prev == NULL) {
head = temp->next;
} else {
prev->next = temp->next;
}
free(temp);
printf("%d deleted successfully\n", num);
return;
} else {
prev = temp;
temp = temp->next;
}
}
printf("%d not found in the list\n", num);
}
void display() {
struct node* current = head;
if (current == NULL) {
printf("List is Empty\n");
return;
}
printf("Elements in the list are: ");
while (current != NULL) {
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
int main() {
int choice, num, loc;
while (1) {
printf("\nList Operations\n");
printf("===============\n");
printf("1. Append\n");
printf("2. Display\n");
printf("3. Size\n");
printf("4. Delete\n");
printf("5. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter the number to append: ");
scanf("%d", &num);
append(num);
break;
case 2:
display();
break;
case 3:
printf("Size of the list is %d\n", getCount());
break;
case 4:
if (head == NULL) {
printf("List is Empty\n");
} else {
printf("Enter the number to delete: ");
scanf("%d", &num);
deleteNode(num);
}
break;
case 5:
return 0;
default:
printf("Invalid option\n");
}
}
return 0;
}