1.双链表的表示:
typedef struct DNode{
ElemType data;//数据域
struct DNode *prior,*next;//前驱与后继
}DNode, *DLinklist;
2.向双链表插入结点:
//关键部分代码:
s->prior = p->prior; //s为待插入结点,p为该处原来存放的结点
p->prior->next = s;
s->next = p;
p->prior = s;
3.删除某一结点:
//关键部分代码:
p->prior->next = p->next;
p->next->prior = p->prior;
free(p);