-
Notifications
You must be signed in to change notification settings - Fork 6
/
Program26.c
184 lines (172 loc) · 4.32 KB
/
Program26.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
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node* next;
};
struct node* first = NULL;
struct node* createNode(int data)
{
struct node* newNode = (struct node*)malloc((sizeof(struct node)));
if(newNode == NULL)
{
printf("Sorry there was an error\n Aborting\n");
exit(0);
}
newNode->next = NULL;
newNode->data = data;
return(newNode);
}
void addElemEnd(int data)
{
struct node *newNode = createNode(data);
if(first == NULL)
{
first = newNode;
}
else
{
struct node *temp = first;
while(temp->next !=NULL)
{
temp = temp->next;
}
temp->next = newNode;
}
}
void addElemAtPos(int data, int pos)
{
if(pos<1)
{
printf("INVALID, Index should start from 1\n");
}
else if(pos == 1)
{
struct node *newNode = createNode(data);
newNode->next = first;
first = newNode;
printf("Element Inserted. \n");
}
else if(first == NULL)
{
printf("Sorry, List Empty, cannot insert at position %d",pos);
}
else
{
// There must be atleast pos-1 elements in the list
int elemNum = 1;
struct node *temp = first;
// on exiting temp should point to pos-1
while(temp!=NULL && elemNum<pos-1)
{
temp = temp->next;
elemNum++;
}
if(temp == NULL)
printf("Sorry, There are only %d nodes in the list", elemNum-1);
else
{
struct node *newNode = createNode(data);
newNode->next = temp->next;
temp->next = newNode;
printf("Element Inserted. \n");
}
}
}
void display()
{
if(first == NULL)
printf("\nList Empty");
else
{
struct node *temp = first;
printf("Head");
while(temp != NULL)
{
printf(" -> %d", temp->data);
temp = temp->next;
}
}
printf("\n");
}
void delete(int data)
{
if(first == NULL)
{
printf("\nList Empty");
}
else
{
struct node *temp = first, *del = NULL;
if(first->data == data)
{
del = first;
first = first->next;
free(del);
printf("\nElement Deleted! \n");
}
else
{
while(temp != NULL)
{
if(temp->next!=NULL && temp->next->data == data)
{
del = temp->next;
temp->next = temp->next->next;
free(del);
printf("\nElement Deleted! \n");
break;
}
temp = temp->next;
}
}
if(del == NULL)
printf("\nElement not found! \n");
}
}
int main()
{
int choice;
do
{
int data, pos;
printf("\n");
printf("1: Add element at end\n");
printf("2: Add element at given position\n");
printf("3: Display Elements\n");
printf("4: Delete Element\n");
printf("5: Exit\n");
printf("Enter your choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("Enter value: ");
scanf("%d",&data);
addElemEnd(data);
break;
case 2:
printf("Enter position at which you want to insert new data: ");
scanf("%d",&pos);
printf("Enter value to insert at position %d: ",pos);
scanf("%d",&data);
addElemAtPos(data, pos);
break;
case 3:
display();
break;
case 4:
printf("[First occurence will be deleted]\n");
printf("Enter value that you want to delete: ");
scanf("%d",&data);
delete(data);
break;
case 5:
break;
default:
printf("Invalid Choice\n");
break;
};
}while(choice != 5);
return 0;
}