在双向链表存储结构中,删除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; 结构 指针 双向 发布时间:2024-04-22 14:37:22