prior->next=t->next;t->next->prior=t->prior;B、t->prior->prior=t->prior;t->next->next=t->next;C、t->prior->next=t->prior;t->next->prior=t->next;D、t->prior->prior=t->next;t->next->prior=t->prior;" /> prior->next=t->n" />
某雙向鏈表中的結點如下圖所示,刪除 t 所指結點的操作為 ( ) 。
A、t->prior->next = t->next; t->next->prior = t->prior;
B、t->prior->prior = t->prior; t->next->next = t->next;
C、t->prior->next = t->prior; t->next->prior = t->next;
D、t->prior->prior = t->next; t->next->prior = t->prior;