在双向链表存储结构中,删除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