forked from dharmanshu9930/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LINKLIST.C
244 lines (244 loc) · 4.3 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
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
#include<stdio.h>
#include<malloc.h>
struct node
{
int info;
struct node *next;
}*start=NULL;
main()
{
int ch,i;
clrscr();
while(1)
{
printf("\n1 Create List");
printf("\n2 Insert at beginning");
printf("\n3 Insert at Last Position");
printf("\n4 Insert before a given location");
printf("\n5 Insert after a given location");
printf("\n6 Delete");
printf("\n7 Search");
printf("\n8 Print");
printf("\n9 Quit");
printf("\nEnter your choice= ");
scanf("%d",&ch);
switch(ch)
{
case 1:
create();
break;
case 2:
insertbeg();
break;
case 3:
insertlast();
break;
case 4:
insertbefore();
break;
case 5:
insertafter();
break;
case 6:
del();
break;
case 7:
search();
break;
case 8:
print();
break;
case 9:
exit();
default:
printf("Wrong choice\n");
}
}
}
create()
{
struct node *temp,*ptr;
char ch='y';
int item;
clrscr();
printf("\n\t\t****INPUT BLOCK****\n");
if(start!=NULL)
{
printf("\n\n\t****LIST IS ALREADY EXIST****");
return;
}
fflush(stdin);
while(ch=='y')
{
temp=(struct node*)malloc(sizeof(struct node));
printf("\n\t Enter the no:==> ");
scanf("%d",&item);
temp->info=item;
temp->next=NULL;
if(start==NULL)
ptr=start=temp;
else
{
ptr->next=temp;
ptr=ptr->next;
}
fflush(stdin);
printf("\t Do you want to continue (y/n)?: ");
ch=getchar();
}
}
insertbeg()
{
struct node *temp;
int item;
printf("Enter the item to be inserted= ");
scanf("%d",&item);
temp=(struct node*)malloc(sizeof(struct node));
temp->info=item;
temp->next=start;
start=temp;
}
insertlast()
{
struct node *temp,*ptr;
int item;
printf("Enter the item to be inserted= ");
scanf("%d",&item);
temp=(struct node*)malloc(sizeof(struct node));
temp->info=item;
temp->next=NULL;
ptr=start;
while(ptr->next!=NULL)
{
ptr=ptr->next;
}
ptr->next=temp;
}
insertafter()
{
struct node *temp,*ptr;
int i,item,pos;
printf("Enter the element: ");
scanf("%d",&item);
printf("Enter the position after which this element is inserted= ");
scanf("%d",&pos);
ptr=start;
for(i=0;i<pos;i++)
{
ptr=ptr->next;
if(ptr==NULL)
{
printf("position %d not available",pos);
return;
}
}
temp=(struct node*)malloc(sizeof(struct node));
temp->next=ptr->next;
temp->info=item;
ptr->next=temp;
}
del(int data)
{
struct node *temp,*ptr;
int item;
if(start==NULL)
{
printf("List is empty\n");
return;
}
printf("Enter the element for deletion= ");
scanf("%d",&item);
if((start->info==item)&&(start->next==NULL))
{
temp=start;
printf("Deleted item is =%d",temp->info);
free(temp);
start=NULL;
return;
}
if(start->info==item)
{
temp=start;
printf("Deleted item is =%d",temp->info);
start=start->next;
free(temp);
return;
}
for(ptr=start;ptr->next->next!=NULL;ptr=ptr->next)
{
if(ptr->next->info==item)
{
temp=ptr->next;
printf("Deleted item is =%d",temp->info);
ptr->next=temp->next;
free(temp);
return;
}
}
if(ptr->next->info==item)
{
temp=ptr->next;
free(temp);
ptr->next=NULL;
return;
}
printf("Item %d doesnot exists in the list\n",item);
}
print()
{
struct node *ptr;
if(start==NULL)
{
printf("List is empty\n");
return;
}
printf("\nLinklist contents are ");
for(ptr=start;ptr!=NULL;ptr=ptr->next)
{
printf("%d",ptr->info);
}
}
search()
{
struct node *ptr;
int loc=1,item;
printf("Enter the element to be searched: ");
scanf("%d",&item);
for(ptr=start;ptr!=NULL;ptr=ptr->next)
{
if(ptr->info==item)
{
printf("Item %d found at position %d\n",item,loc);
return;
}
loc++;
}
if(ptr==NULL)
{
printf("Item %d not found in list\n",item);
return;
}
}
insertbefore()
{
struct node *temp,*ptr;
int i,item,pos;
printf("Enter the element= ");
scanf("%d",&item);
printf("Enter the position before which this element is inserted: ");
scanf("%d",&pos);
ptr=start;
for(i=0;i<pos-2;i++)
{
ptr=ptr->next;
if(ptr==NULL)
{
printf("position %d not available ",pos);
return;
}
}
temp=malloc(sizeof(struct node));
temp->next=ptr->next;
temp->info=item;
ptr->next=temp;
}