-
Notifications
You must be signed in to change notification settings - Fork 0
/
LINLLISTbetween.c
111 lines (88 loc) · 2.9 KB
/
LINLLISTbetween.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
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *insertbegining(struct node *head, int data)
{
struct node *newelement=(struct node *)malloc(sizeof(struct node));
if(head==NULL)
printf("element we can not insert in link list\n");
else
{
newelement->data=data;
newelement->next=head;
return newelement;
}
}
struct node * last(struct node *head, int data)
{
struct node *lastinsert=(struct node *)malloc(sizeof(struct node));
struct node *p=head;
while(p->next!=NULL)
{
p=p->next;
}
lastinsert->data=data;
p->next=lastinsert;
lastinsert->next=NULL;
return head;
}
struct node * between(struct node *head, int data, int index)
{
struct node *ptr=(struct node *)malloc(sizeof(struct node));
struct node *p;
int i=0;
p=head;
while(i!=index-1)
{
p=p->next;
i++;
}
ptr->data=data;
ptr->next=p->next;
p->next=ptr;
return head;
}
void traverse(struct node *head)
{
while(head!=NULL)
{
printf("Element:%d\n",head->data);
head=head->next;
}
}
int main()
{
struct node *head=(struct node*)malloc(sizeof(struct node));
struct node *first=(struct node*)malloc(sizeof(struct node));
struct node *second=(struct node*)malloc(sizeof(struct node));
struct node *third=(struct node*)malloc(sizeof(struct node));
struct node *four=(struct node*)malloc(sizeof(struct node));
head->data=100;
head->next=first;
first->data=200;
first->next=second;
second->data=300;
second->next=third;
third->data=400;
third->next=four;
four->data=500;
four->next=NULL;
printf("Before insert element\n");
traverse(head);
head=between(head, 1000,2);
printf("After between insert in element\n");
traverse(head);
head=last(head,2000);
printf("After ene insert element\n");
traverse(head);
head=insertbegining(head,200);
printf("After begining inset element\n");
traverse(head);
getch();
return 0;
}