在线性链表的插入算法中,若要把结点q插在结点P后面,下列操作正确的是:()
A.使结点P指向结点q,再使结点q指向结点P的后件结点
B.使结点q指向P的后件结点,再使结点P指向结点q
C.使结点q指向结点P,再使结点P指向结点q的后件结点
D.使结点P指向q的后件结点,再使结点q指向结点P
A.使结点P指向结点q,再使结点q指向结点P的后件结点
B.使结点q指向P的后件结点,再使结点P指向结点q
C.使结点q指向结点P,再使结点P指向结点q的后件结点
D.使结点P指向q的后件结点,再使结点q指向结点P
A.s->next=p->next;p->next=s;
B.q->next=s;s->next=p;
C.p->next=s->next;s->next=p;
D.p->next=s;s->next=q;
A.p->next=p->next->next;
B.p=p->nextp->next=p->next->next;
C.p->next=p->next;
D.p=p->next->next;
A.while(p->next!=NULL)p=p->next;p->next=s;s->next=NULL;
B.while(p!=NULL)p=p->next;p->next=s;s->next=NULL;
C.while(p->next!=NULL)p=p->next;s->next=p;p->next=NULL;
D.while(p!=NULL)p=p->next->next;p->next=s;s->next=p->next;
A、p->next = pr->next; pr->next = p;
B、struct node * pTemp; pTemp = pr->next; pr->next = p; p->next = pTemp;
C、pr->next = p;
D、p->next = pr->next; pr = p;
E、pr->next = p; p->next = pr->next;
A.p->next=s;s->next=p->next;
B.s->next=p->next;p->next=s;
C.p->next=s;p->next=s->next;
D.p->next=s->next;p->next=s;
A.p->right=s; s->left=p; p->right->left=s; s->right=p->right;
B.s->left=p;s->right=p->right;p->right=s; p->right->left=s;
C.p->right=s; p->right->left=s; s->left=p; s->right=p->right;
D.s->left=p;s->right=p->right;p->right->left=s; p->right=s;
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!