【单选题】已知一个带有表头结点的双向循环链表L,结点结构为 其中,prev和next分别是指向其直接前驱和直接后继结点的指针。现要删除指针P所指的结点,正确的语句序列是()
A.
p.p1%20%7Bmargin%3A%200.0px%200.0px%200.0px%206.0px%3B%20text-align%3A%20justify%3B%20font%3A%2010.5px%20Calibri%7D%0Aspan.s1%20%7Bfont%3A%2010.5px%20%26%2339%3BTimes%20New%20Roman%26%2339%3B%7D p->next->prev=p->prev; p->prev->next=p->prev; free(p);
B.
p.p1%20%7Bmargin%3A%200.0px%200.0px%200.0px%206.0px%3B%20text-align%3A%20justify%3B%20font%3A%2010.5px%20Calibri%7D%0Aspan.s1%20%7Bfont%3A%2010.5px%20%26%2339%3BTimes%20New%20Roman%26%2339%3B%7D p->next->prev=p->next; p->prev->next=p->next; free(p);
C.
p.p1%20%7Bmargin%3A%200.0px%200.0px%200.0px%206.0px%3B%20text-align%3A%20justify%3B%20font%3A%2010.5px%20Calibri%7D%0Aspan.s1%20%7Bfont%3A%2010.5px%20%26%2339%3BTimes%20New%20Roman%26%2339%3B%7D p->next->prev=p->next; p->prev->next=p->prev; free(p);
D.
p.p1%20%7Bmargin%3A%200.0px%200.0px%200.0px%206.0px%3B%20text-align%3A%20justify%3B%20font%3A%2010.5px%20Calibri%7D%0Aspan.s1%20%7Bfont%3A%2010.5px%20%26%2339%3BTimes%20New%20Roman%26%2339%3B%7D p->next->prev=p->prev; p->prev->next=p->next; free(p);