双链表的基本操作

一、双向链表的类型定义

typedef int ElemType;
typedef struct DLNode
{
	ElemType data;
	struct DLNode *prior,*next;
}DLNode,*DLinkList

二、双链表的插入

s->prior=p->prior;
s-next=p;
p->prior->next=s;
p->prior=s;

三、双链表的删除

p->prior->next=p->next;
=->next->prior=p->prior;
delete p;