已知一个带有头结点的双向循环链表 D L ,结点结构为 : (pre,data,next) ,其中, pre 是指向其直接前驱结点的指针, next 是指向其直接后继结点的指针。现在要删除指针 p 所指结点本身,正确的语句序列是 ( ) 。
A.
p->next->pre=p->next; p->pre->next=p->pre; delete p;
B.
p->next->pre=p->next; p->pre->next=p->next; delete p;
C.
p->next->pre=p->pre; p->pre->next=p->next; delete p;
D.
p->next->pre=p->pre; p->pre->next=p->pre; delete p;