-
Notifications
You must be signed in to change notification settings - Fork 0
/
linklist_delete.c
89 lines (72 loc) · 1.57 KB
/
linklist_delete.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
#include <stdio.h>
#include <stdlib.h>
struct Node{
int data;
struct Node *next;
};
void lltrav(struct Node *ptr){
while(ptr!=NULL){
printf("%d ",ptr->data);
ptr=ptr->next;
}
}
struct Node *deletefirst(struct Node *head){
struct Node * ptr=head;
head = head->next;
free(ptr);
return head;
};
struct Node *deleteindex(struct Node *head,int index){
struct Node *p=head;
struct Node *q=head->next;
for(int i = 0;i<index-1;i++){
p=p->next;
q=q->next;
}
p->next=q->next;
free(q);
return head;
};
struct Node *deleteend(struct Node *head){
struct Node *p=head;
struct Node *q=head->next;
while(q->next!=NULL){
p=p->next;
q=q->next;
}
p->next=NULL;
free(q);
return head;
};
struct Node *deletevalue(struct Node *head,int value){
struct Node *p=head;
struct Node *q=head->next;
while(q->data != value && q->next != NULL){
p=p->next;
q=q->next;
}
if(q->data == value){
p->next=q->next;
free(q);
}
return head;
};
int main(){
struct Node *head;
struct Node *second;
struct Node *third;
head = (struct Node *)malloc(sizeof(struct Node));
second = (struct Node *)malloc(sizeof(struct Node));
third = (struct Node *)malloc(sizeof(struct Node));
head->data=89;
head->next=second;
second->data=108;
second->next=third;
third->data=200;
third->next=NULL;
lltrav(head);
head = deletevalue(head,108);
printf("\n");
lltrav(head);
return 0;
}