单链表:
头插
new->next = p->next;
p->next = new;
尾插
while(p->next != NULL)//先遍历到尾节点
{
p = p->next;
}
p->next = new;
======================================================
双向链表:
头插
new->next = p->next;
if(p->next != NULL)
p->next->prev = new;
p->next = new;
new->prev = p;
尾插
while(p->next != NULL)//先遍历到尾节点
{
p = p->next;
}
new->prev = p;
p->next = new;