forked from I-RoshanKumar/Beginner_Hactoberfest2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked list operations.c
220 lines (159 loc) · 4.05 KB
/
linked list operations.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
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *next;
}*head;
void createList(int n);
void insertAtBeginning(int data);
void insertAtEnd(int data);
void insertAtPos(int data, int position);
void traverseList();
int main()
{
int n, data ,position;
printf("Enter the total number of nodes: ");
scanf("%d", &n);
createList(n);
printf("\nFinal data in the linked list \n");
traverseList();
printf("\nEnter data to insert at beginning of the list: ");
scanf("%d", &data);
insertAtBeginning(data);
printf("\nFinal data in the linked list \n");
traverseList();
printf("\nEnter data to insert at end of the list: ");
scanf("%d", &data);
insertAtEnd(data);
printf("\nFinal data in the linked list \n");
traverseList();
printf("\nEnter the position where you want to insert new node: " );
scanf("%d", &position);
printf("\nEnter data you want to insert at position %d of the list: ", position);
scanf("%d", &data);
insertAtPos(data, position);
printf("\nFinal data in the linked list \n");
traverseList();;
return 0;
}
void createList(int n)
{
struct node *newNode, *temp;
int data, i;
head = (struct node *)malloc(sizeof(struct node));
if(head == NULL)
{
printf("Unable to allocate memory.");
}
else
{
printf("Enter the data of node 1: ");
scanf("%d", &data);
head->data = data;
head->next = NULL;
temp = head;
for(i=2; i<=n; i++)
{
newNode = (struct node *)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
break;
}
else
{
printf("Enter the data of node %d: ", i);
scanf("%d", &data);
newNode->data = data;
newNode->next = NULL;
temp->next = newNode;
temp = temp->next;
}
}
printf("Singly linked list created successfully\n");
}
}
void insertAtBeginning(int data)
{
struct node *newNode;
newNode = (struct node*)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data;
newNode->next = head;
head = newNode;
printf("Data inserted successfully\n");
}
}
void insertAtEnd(int data)
{
struct node *newNode, *temp;
newNode = (struct node*)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data;
newNode->next = NULL;
temp = head;
while(temp != NULL && temp->next != NULL)
temp = temp->next;
temp->next = newNode;
printf("Data inserted successfully\n");
}
}
void insertAtPos(int data, int position)
{
int i;
struct node *newNode, *temp;
newNode = (struct node*)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data;
newNode->next = NULL;
temp = head;
for(i=2; i<=position-1; i++)
{
temp = temp->next;
if(temp == NULL)
break;
}
if(temp != NULL)
{
newNode->next = temp->next;
temp->next = newNode;
printf("Data inserted successfully\n");
}
else
{
printf("Unable to insert data at the given position\n");
}
}
}
void traverseList()
{
struct node *temp;
if(head == NULL)
{
printf("List is empty.");
}
else
{
temp = head;
while(temp != NULL)
{
printf("%d\n", temp->data);
temp = temp->next;
}
}
}