-
Notifications
You must be signed in to change notification settings - Fork 0
/
PracticeLinkedList_insertion.c
84 lines (81 loc) · 1.73 KB
/
PracticeLinkedList_insertion.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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
void traverseLinkedList(struct node *ptr)
{
while(ptr!=NULL)
{
printf("Your element is %d\n",ptr->data);
ptr = ptr->next;
}
}
struct node *insertAtFront(struct node *head,int val)
{
struct node *p = (struct node*)malloc(sizeof(struct node));
p->next=head;
p->data=val;
return p;
};
void searchLinkedList(struct node *ptr,int val)
{
int count= 0;
int f=0;
while(ptr->next!=NULL)
{
if(ptr->data==val)
{
f=1;
break;
}
ptr = ptr->next;
count++;
}
if(f==1)
{
printf("Data is at node %d\n",count);
}
else{
printf("Data not found!!!");
}
};
struct node *insertAtIndex(struct node *head,int index,int val)
{
struct node *ptr = (struct node*)malloc(sizeof(struct node*));
struct node *p = head;
int i =0;
while(i!=index-1)
{
p = p->next;
i++;
}
ptr->data = val;
ptr->next = p->next;
p->next = ptr;
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=10;
head->next=second;
second->data=20;
second->next=third;
third->data=30;
third->next=NULL;
traverseLinkedList(head);
head = insertAtFront(head,1);
traverseLinkedList(head);
searchLinkedList(head,10);
head = insertAtIndex(head,1,2);
traverseLinkedList(head);
return 0;
}