实现单链表的插入

node *insert(node *head, int num) // 单链表的插入，num是要插入的数值
{
printf("\n在链表中插入数值：%d", num);
node *p0, *p1, *p2;
p1 = head;


p0 = (node *)malloc(sizeof(node));
p0->data = num;
while(p0->data > p1->data && p1->next != NULL)
{
p2 = p1;
p1 = p1->next;
}
if(p1->data >= p0->data)
{
if(p1 == head)
{
p0->next = p1;
head = p0;
}
else
{
p2->next = p0;
p0->next = p1;
}
}
else
{
p1->next = p0;
p0->next = NULL;
}
//
return head;
}