双向链表结构
typedef struct DualNode
{
int data;
struct DualNode *prior; //前驱结点
struct DualNode *next; //后继结点
}DualNode,*DuLinkList;
插入操作
s->next = p;
s->prior = p->prior;
p->prior->next = s;
p->prior = s;
删除操作
p->prior->next = p->next;
p->next->prior = p->prior;
free(p);