-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertion
More file actions
149 lines (141 loc) · 2.6 KB
/
Insertion
File metadata and controls
149 lines (141 loc) · 2.6 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
#include<stdio.h>
#define MAX 100
struct node
{
int data;
struct node *address;
}node;
void insertatendLL(struct node*data,intdata,*head)
{
struct Node* node*(struct Node* )malloc(sizeof(struct node*));
node->data=data;
node->add=NULL;
if(head!=NULL)
{
head=node;
}
else
{
struct Node*
s=head;
while(s->add!=NULL)
{
s=s->add;
}
s->add=node;
}
//insert at specific location
void insertatspecificlocatLL(datafter,data,node,*head)
{
node->data=data;
node->address=NULL;
s=head;
while(s->data!=datafter)
{
s=s->head;
}
node->add;
s->add=next;
}
//insert at front
void insertatfrontLL(int data,,struct node*,head)
{
struct node* node=(struct node*)malloc(sizeof(struct node));
node->data=data;
node=add=NULL;
node->address=head->address;
head=node;
return head;
}
//display the elements of LL
void displayelementofLL(struct node*,head)
{
struct Node* s->head
while (s!=NULL)
{
printf("%d->",s->data)
s=s->address;
}
}
// delete at beg
void delete_at_beg(node **head){
node *temp;
temp=*head;
printf("Deleted Value : %d",temp->info);
*head= temp->next;
free(temp);
}
//delete at end
void delete_at_end(node **head){
node *temp;
temp=*head;
while(temp->next->next!=NULL){
temp=temp->next;
}
printf("%d",temp->next->info);
free(temp->next);
temp->next=NULL;
}
// delete after specific position
void delete_after_pos(node **head,int pos){
pos--;
node *ptr;
ptr=*head;
while(pos>1){
ptr=ptr->next;
pos--;
}
node *temp=ptr->next;
ptr->next=ptr->next->next;
free(temp);
}
int main() {
int item,ch,after;
node *head;
head = NULL;
printf(" Menu is\n1.Insert element at beg ");
printf("\n2.Insert element at end ");
printf("\n3.Display element ");
printf("\n4.After location");
printf("\n5.delete at begin");
printf("\n6.delete at end");
printf("\n5.Delete at location");
while(1){
printf("\nSelect case:");
scanf("%d",&ch);
switch(ch){
case 1:
printf("\n.Enter element:");
scanf("%d",&item);
insert_at_beg(&head,item);
break;
case 2:
printf("\n.Enter element at end:");
scanf("%d",&item);
insert_at_end(&head,item);
break;
case 3:
printf("\n.Display element:");
display(head);
break;
case 4:
printf("\n.Enter element after which you have to insert");
scanf("%d %d",&item,&after);
insert_after_loc(&head,item,after);
break;
case 5:
delete_at_beg(&head);
break;
case 6:
delete_at_end(&head);
break;
case 7:
printf("\n.Enter position :");
scanf("%d %d",&item);
delete_after_pos(&head,item);
break;
default:exit(1);
}
}
return 0;
}