在双向链表存储结构中删除p所指的结点时，需要按___修改指针的链接。
A: p->prior->next=p->next; p->next->prior=p->prior;
B: p->prior=p->prior->next; p->prior->prior->next=p;
C: p->prior->prior->next=p; p->prior=p->prior->prior;
D: p->next->next->prior=p; p->next=p->next->next;
A: p->prior->next=p->next; p->next->prior=p->prior;
B: p->prior=p->prior->next; p->prior->prior->next=p;
C: p->prior->prior->next=p; p->prior=p->prior->prior;
D: p->next->next->prior=p; p->next=p->next->next;
举一反三
- 在双向链表存储结构中删除p所指的结点时，需要按___修改指针的链接。 A: p->prior->next=p->next; p->next->prior=p->prior; B: p->prior=p->prior->next; p->prior->prior->next=p; C: p->prior->prior->next=p; p->prior=p->prior->prior; D: p->next->next->prior=p; p->next=p->next->next;
- 在双向链表存储结构中，删除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->next = p->prior->next; D: p->next = p->prior->prior; p->prior = p->next->next;
- 在双向链表存储结构中删除p所指的结点时，修改指针的语句是 A: p->next=p->next->next;p->next->prior=p; B: p->next->prior=p->prior;p->prior->next=p->next; C: p->prior->next=p;p->prior=p->prior->prior; D: p->prior=p->next->next;p->next=p->prior->prior;
- 在双向链表存储结构中，删除p所指的结点时须修改指针（ ）。 A: p->next=p->next->next; p->next->prior=p; B: p->next->prior=p->prior; p->prior->next=p->next; C: p->prior=p->next->next; p->next=p->prior->prior; D: p->prior->next=p; p->prior=p->prior->prior;
- 在双向链表存储结构中,删除p所指结点时修改指针的操作为( )。 A: p->prior->next=p->next;p->next->prior=p->prior; B: p->next=p->next->next;p->next->prior=p; C: p->prior->next=p;p->prior=p->prior->prior; D: p->prior=p->next->next;p->next=p->prior->prior;