-
Notifications
You must be signed in to change notification settings - Fork 0
/
Linklist.c
212 lines (169 loc) · 3.45 KB
/
Linklist.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
#include <stdio.h>
#include <stdlib.h>
struct node {
int value;
struct node *next;
};
typedef struct node Node;
Node *head;
Node *tail;
void insert(int);
int fetch(int);
void display(void);
void removee(void);
int main(int argc, char *argv[]) {
int choice;
int value;
int index;
while(1) {
printf("What do you want to do?\n\n");
printf("1. Insert \n2. Fetch \n3. display \n4. Remove\n5. Exit\n");
scanf("%d", &choice);
switch(choice) {
case 1:
printf("\nEnter the value you want to insert!\n");
scanf("%d", &value);
insert(value);
printf("\nInserted the value %d into linkedList\n", value);
break;
case 2:
printf("\nValue at what index you want to fetch\n");
scanf("%d", &index);
value = fetch(index);
printf("\nValue at index %d is %d\n", index, value); //need to fetch real value
break;
case 3:
display();
break;
case 4:
removee();
break;
case 5:
printf("\nExiting...\n");
exit(0);
default:
break;
}
}
}
void insert(int value) {
if(head == NULL) {
head = (Node *)malloc(sizeof(Node));
head->value = value;
head->next = NULL;
tail = head;
} else {
tail->next = (Node *)malloc(sizeof(Node));
tail->next->value = value;
tail->next->next = NULL;
tail = tail->next;
}
}
int fetch(int index) {
int i;
if(head == NULL) {
printf("linklist is empty");
}
Node *pointer = head;
for ( i = 0; i < index; i++) {
if(pointer->next == NULL) {
return -1;
}
pointer = pointer->next;
}
return pointer->value;
}
void display()
{
int i;
Node *im;
im=head;
if (head==NULL)
{
printf("Linklist is empty\n");
}
else
{
printf ("\n The status of the link list is \n");
while(im->next!=NULL)
{
printf ("%d\n",(im->value));
im=im->next;
}
printf ("%d\n",(im->value));
return;
}
}
void removee(){
int rem,ind;
printf("condition for removing\n1. By index\n2. By value\n") ;
scanf("%d",&rem);
switch(rem)
{
case 1:
printf("At what index u want to remove");
scanf("%d",&ind);
rem1(ind);
break;
case 2:
printf("What value you want to remove");
scanf("%d",&ind);
rem2(ind);
break;
default:
break;
}
}
void rem1(ind)
{
int i;
if(head == NULL) {
printf("linklist is empty");
}
Node *p = head;
if(ind==0)
{
head=p->next;
}
else
{
for ( i = 1; i < ind; i++) {
if(p->next == NULL) {
printf("No. at index not found");
}
p=p->next;
}
if(p->next==tail)
{
tail=p;
}
p->next=p->next->next;
}
printf("no. at index %d is deleted",ind);
}
void rem2(ind)
{
Node *prev=head;
if(prev->value == ind)
{
prev = prev->next;
head=prev;
return;
}
while(prev->next != NULL && prev->next->value != ind)
{
prev = prev->next;
}
if(prev->next == NULL)
{
printf("\n Given node is not present in Linked List");
return;
}
if(prev->next==tail)
{
tail=prev;
}
prev->next = prev->next->next;
printf("\n Given node is Removed From Linked List");
return;
}