-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked_delete_index.c
66 lines (54 loc) · 1.15 KB
/
linked_delete_index.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
#include <stdio.h>
#include <stdlib.h>
struct node
{
struct node *next;
int data;
};
void traversal(struct node *ptr)
{
while (ptr != NULL)
{
printf("Element : %d \n", ptr->data);
ptr = ptr->next;
}
}
struct node *deleteatindex(struct node *head, int index)
{
struct node *p = head;
struct node *q = head->next;
int i = 0;
while (i != index - 1)
{
p = p->next;
q = q->next;
i++;
}
p->next = q->next;
free(q);
return head;
}
int main()
{
struct node *head;
struct node *second;
struct node *third;
struct node *fourth;
head = (struct node *)malloc(sizeof(struct node));
second = (struct node *)malloc(sizeof(struct node));
third = (struct node *)malloc(sizeof(struct node));
fourth = (struct node *)malloc(sizeof(struct node));
head->data = 90;
head->next = second;
second->data = 35;
second->next = third;
third->data = 42;
third->next = fourth;
fourth->data = 53;
fourth->next = NULL;
traversal(head);
deleteatindex(head, 2);
printf("After deletion:\n");
traversal(head);
return 0;
}