双链表的节点描述如下 :
typedef struct DNode{
Elemtype data;
struct Dnode *prior,*next;
}Dnode,*DLinklist;
双链表的插入操作
在双链表中p所指结点之后插入节点*s
s->next = p->next;
p->next->prior = s;
p->next = s;
s->prior = p;
双链表的删除操作
删除双链表中*p的后继结点*q
p->next=q->next;
q->next->prior = p;
free(q);