在循环双链表的 p 所指的结点之前插入 s 所指结点的操作是( ) A: p->prior = s ; s->next = p ; p->prior->next = s ; s->prior = p->prior B: p->prior = s ; p->prior->next = s ; s->next = p ; s->prior = p->prior C: s->next = p ; s->prior = p->prior ; p->prior = s ; p->prior->next = s D: s->next = p ; s->prior = p->prior ; p->prior->next = s ; p->prior = s

在循环双链表的p所指的结点之前插入s所指结点的操作是（ ）。 A: p->prior = s ;s->next = p ;p->prior->next = s ;s->prior = p->prior B: p->prior = s ;p->prior->next = s ;s->next = p ;s->prior = p->prio C: s->next = p ;s->prior = p->prior ;p->prior = s ;p->prior->next = s D: s->next = p ;s->prior = p->prior ;p->prior->next = s ;p->prior = s

在双向链表存储结构中，删除p所指的结点的前趋结点（若存在）时需修改指针（ ） A: ((p->llink) ->llink) ->rlink=p; p->llink=(p->llink) ->llink; B: ((p->rlink) ->rlink) ->llink=p; p->rlink=(p->rlink) ->rlink; C: (p->llink) ->rlink=p->rlink; (p->rlink) ->llink=p->llink; D: p->llink=(p->llink) ->llink; ((p->llink) ->llink) ->rlink=p;

在循环双链表的p所指向结点之后插入结点s的操作步骤是（ ）。 A: p->next=s; s->prior=p; p->next->prior=s; s->next=p->prior; B: p->next=s; p->prior->next=s；s->prior=p; s->next=p->next; C: s->prior=p; s->next=p->next; p->next=s; p->next->prior=s; D: s->prior=p; s->next=p->next; p->next->prior=s; p->next =s;

在双向链表存储结构中，删除p所指的结点时须修改指针（） A: （p->prior)->next=p->next;（p->next）->prior=p->prior; B: p->prior=（p->prior）->prior;（p->prior）->next=p; C: (p->next）->prior=p;p->rlink=（p->next）->next; D: p->next=（p->prior）->prior;p->prior=（p->next）->next