单链表插入一个节点：
struct link InsertNode(struck link head ,int nodeData)
struck link p = head;pr = head;temp = NULL
if (head == NULL)
head = p
else
while (pr->data < nodeData && pr->next ! = NULL)
temp = pr;
pr = pr->next
if (pr == head)
p->next = head;
head = p
else
pr = temp;
p->next = pr->next
pr->next = p
else
pr->next = p;
return head;
单链表删除一个节点：
struct link DeleteNode (struct link head, int nodeData)
struct link p = head, pr = head;
if (head == NULL)
return 0;
while (nodeData != p->data && p->next != NULL)
pr = p;
p = p->next;
if (p == head)
head = p->next;
else
pr->next = p->next;
else
return head
参考资料：链表（单向链表的建立、删除、插入、打印） - 蓝海人 - 博客园 (cnblogs.com)
