在双向链表存储结构中,删除 p 所指的结点时须修改指针( )
·p->next->prior=p->prior; p->prior->next=p->next;
·p->next=p->next->next; p->next->prior=p;
·p->prior->next=p; p->prior=p->prior->prior;
·p->prior=p->next->next; p->next=p->prior->prior;