-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathSingly_Linked_List.c
More file actions
207 lines (205 loc) · 4.21 KB
/
Singly_Linked_List.c
File metadata and controls
207 lines (205 loc) · 4.21 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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *head=NULL,*newnode,*temp;
void create()
{
head=NULL;
newnode=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newnode->data);
newnode->next=NULL;
head=newnode;
}
void insert_beg()
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newnode->data);
newnode->next=NULL;
if(head==NULL)
{
head=newnode;
}
else
{
newnode->next=head;
head=newnode;
}
}
void insert_any()
{
int pos,i=1;
printf("Enter the position : ");
scanf("%d",&pos);
if(pos==1)
insert_beg();
else
{
temp=head;
while (i<pos-1)
{
temp=temp->next;
i++;
}
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newnode->data);
newnode->next=temp->next;
temp->next=newnode;
}
}
void insert_last()
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newnode->data);
newnode->next=NULL;
if(head==NULL)
{
head=newnode;
}
else
{
temp=head;
while (temp->next!=NULL)
{
temp=temp->next;
}
temp->next=newnode;
}
}
void delete_beg()
{
if(head==NULL)
printf("Cannot delete !!! List is empty");
else
{
temp=head;
head=head->next;
free(temp);
}
}
void delete_any()
{
if(head==NULL)
printf("Cannot delete !!! List is empty\n");
else
{
int pos,i=1;
printf("Enter position : ");
scanf("%d",&pos);
temp=head;
while(i<pos-1)
{
temp=temp->next;
i++;
}
nextnode=temp->next;
temp->next=nextnode->next;
free(nextnode);
}
}
void delete_last()
{
if(head==NULL)
printf("Cannot delete !!! List is empty");
else
{
struct node *prevnode;
temp=head;
while(temp->next!=NULL)
{
prevnode=temp;
temp=temp->next;
}
if(head==temp)
head=NULL;
else
prevnode->next=NULL;
free(temp);
}
}
void display()
{
int count=0;
temp=head;
printf("Elements are : ");
while(temp!=NULL)
{
printf("%d ",temp->data);
temp=temp->next;
count++;
}
printf("\nTotal number of elements : %d\n",count);
}
int main()
{
int op,ch;
while(1)
{
printf("\n1. Create a list\n2. Insert an element\n3. Delete an element\n4. Display the elements\n5. Exit\n\nEnter your choice : ");
scanf("%d",&op);
switch (op)
{
case 1:
create();
break;
case 2:
{
printf("\n1. Insert at beginning\n2. Insert at any position\n3. Insert at last\n\nEnter your choice : ");
scanf("%d",&ch);
switch (ch)
{
case 1:
insert_beg();
break;
case 2:
insert_any();
break;
case 3:
insert_last();
break;
default:
printf("Wrong choice !!! Try again..");
break;
}
break;
}
case 3:
{
printf("\n1. Delete from beginning\n2. Delete from any position\n3. Delete from last.\n\nEnter your choice : ");
scanf("%d",&ch);
switch (ch)
{
case 1:
delete_beg();
break;
case 2:
delete_any();
break;
case 3:
delete_last();
break;
default:
printf("Wrong choice !!! Try again..");
break;
}
break;
}
case 4:
display();
break;
case 5:
exit(0);
break;
default:
printf("Wrong Choice!!\nTry again\n");
break;
}
}
}