已知p指向双向循环链表中的一个结点,其结点结构为data、prior、next三个域,写出算法change(p),交换p所指向的结点和它的前缀结点的顺序。
A、p->next->prev=p->prev;p->prev->next=p->next;free(p);
B、p->next->prev=p->next;p->prev->next=p->next;free(p);
C、p->next->prev=p->next;p->prev->next=p->prev;free(p);
D、p->next->prev=p->prev;p->prev->next=p->prev;free(p);
A、p->pre=q;q->next=p;p->pre->next=q;q->pre=p->pre;
B、q->pre=p->pre;p->pre->next=q;q->next=p;p->pre=q->next;
C、q->next=p;p->next=q;p->pre->next=q;q->next=p;
D、p->pre->next=q; q->next=p; q->pre=p->pre;p->pre=q;
A、p->prior->next=p->next; free(p); p->next->prior=p->prior;
B、p->next->prior=p->prior; free(p); p->prior->next=p->next;
C、p->prior->next=p->next; p->next->prior=p->prior; free(p);
D、p->prior->next=p->next; p->next->prior=p->prior;
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!