Data-Structure-and-Algorithm/INS_POS_.C at master · eng-arvind/Data-Structure-and-Algorithm · GitHub

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
#include<stdio.h>
#include<conio.h>
struct node
{
int info;
struct node* next;
};
typedef struct node* nodep;
nodep ins_pos(nodep);
nodep add();
nodep create();
void display(nodep);
void main()
{
nodep start=NULL;
clrscr();
start=add();
start=ins_pos(start);
display(start);
getch();
}
nodep add()
{
nodep t,t1,start=NULL;
char ch;
printf("creation of list\n");
do{
t=create();
if(start==NULL)
start=t;
else
t1->next=t;
t1=t;
printf("do you want to add more(y/Y)\n");
scanf(" %c",&ch);
}while(ch=='y' || ch=='Y');
return start;
}
nodep create()
{
nodep t=NULL;
t=(nodep)malloc(sizeof(struct node));
if(t==NULL)
{
printf("overflow\n");
exit(0);
}
t->next=NULL;
printf("Enter data\n");
scanf("%d",&t->info);
return t;
}
nodep ins_pos(nodep start)
{
nodep t,t1;
int pos,count;
printf("Enter position\n");
scanf("%d",&pos);
t=create();
if(pos==1)
{
t->next=start;
start=t;
return start;
}
else if(pos>1)
{
count=2;
t1=start;
while(t1!=NULL && count<pos)
{
t1=t1->next;
count++;
}
if(count==pos)
{
t->next=t1->next;
t1->next=t;
}
else
printf("Position is greater than size of list\n");
}
else
printf("position is negative\n");
return start;
}
void display(nodep t)
{
printf("list is::->\n");
while(t!=NULL)
{
printf("%d\t",t->info);
t=t->next;
}
}