双向链表的插入
参考来源:数据结构与算法基础(青岛大学-王卓)p38
算法实现:
void ListInset_DuL(DuLinkList &L,int i,ElemType e){
if(!(p=GetElemp_DuL(L,i)))return error;
s=new DuLnode; s->data = e;
s->prior = p->prior; //1
p->prior->next = s; //2
s->next = p; //3
p->prior = s; //4
return Ok;
}
注:GetElemp_DuL(L,i) 返回插入位置i的地址值,并赋予给p