静态链表从指定节点后方插入节点

#include<stdio.h>
sturct node
{
int data;
struct node *next;
};
int  insertfrombeh(int data,struct node *head,struct node *new)
{
struct node*p=head;
while(p!=NULL)
{
if(p->data==data)
{
new->next=p->next;
p->next=new;
return 1;
}
p=p->next;
}
return 0;
}
void printlink(struct node *head)//打印新的链表
{
struct node *p=head;
while(p!=NULL)
{
printf(" %d ",p->data);
p=p->next;
}
putchar('\n');
}
int main()
{
struct node t1={1,NULL};
struct node t2={2,NULL};
struct node t3={3,NULL};
struct node t4={4,NULL};
struct node new={100,NULL};
t1.next=&t2;
t2.next=&t3;
t3.next=&t4;
printf("原来的数字是1 2 3 4\n");
insertfrombeh(3,&t1,&new);
printf("找到data=3的结点并成功在data=3后插入data=100后的数字是\n");
printlink(&t1);
insertfrombeh(200,&t1,&new);
printf("未找到data=200的结点插入失败后的数字是\n");
printlink(&t1);
return 0;
}