void insert(linklist *s,int sorce,int d)
{
linklist *p,*t;int i=1;
p=s;
while(i<sorce)
{
p=p->next;
i++;
}

while(p->data!=NULL)
{
t->data=d;
t->next=p->next;
p->next=t;
}
}

#include <stdio.h>
#include <malloc.h>
#define datatype int
#define max 100
typedef struct link
{
	datatype data;
    struct link *next;

}linklist;
linklist * init(linklist * s)
{	linklist t;
	s=(linklist *)malloc(sizeof(t));
	return s;
}
void insert(linklist *s,int sorce,int d)
{
		linklist *p,*t;int i=1;
		p=s;
		t=init(t);
		while(i<sorce)
		{
			p=p->next;
			i++;
		}
		
		while(p->data!=NULL)
		{
			t->data=d;
			t->next=p->next;
			p->next=t;
		}
}
void scan(linklist *s)
{
	linklist *p,*t;
	p=s;
	t=(linklist *)malloc(sizeof(t));
	printf("please inster the Number:\n");
	for(int i=0;i<10;i++)
	{	
		
		scanf("%d",&t->data);
	    p->data=t->data;
	    p->next=t;
	}
}
void print(linklist *s)
{
	while (s->next!=NULL)
	{
		printf("%d ",s->data);
		s=s->next;
	}
}
int main()
{
	 
	linklist *p;
	p=init(p);
	scan(p);
	insert(p,2,6);
	print(p);
	return 0;
}

while(p->data!=NULL)
{
t->data=d;
t->next=p->next;
p->next=t;
}

for(int i=0;i<10;i++)
{

scanf("%d",&t->data);
p->data=t->data;
p->next=t;
}