A: s->next=p->next; p->next=s;
B: s->next=p; p->next=s;
C: s->next=p¬->next; p=s;
D: p->next=s; s->next=p;
举一反三
- 若已建立以下链表结构，指针p、s分别指向如图所示结点。 则不能将s所指结点插入到链表末尾的语句组是______。 A: p=p->next; s ->next=p; p->next=s; B: s ->next='\0'; p=p->next; p->next=s; C: p=p->next; s ->next=p->next; p->next=s; D: p=(*p).next; (*s ).next=(*p).next; (*p).next=s;
- 在一个单链表中， 若删除 p 所指结点的后续结点， 则执行（ ） A: s->next=p;p->next=s; B: s->next=p->next;p=s; C: s->next=p->next;p->next=s; D: p->next=s;s->next=p;
- 在循环双链表的p所指结点之后插入s结点的操作是（ ） A: p->next=s; s->pre=p; p->next->pre=s; s->next=p->next; B: p->next=s; p->next->pre=s; s->pre=p; s->next=p->next; C: s->pre=p; s->next=p->next; p->next->pre=s; p->next=s; D: s->pre=p; s->next=p->next; p->next=s; p->next->pre=s;
- 在非空双向链表中,若要在p结点后面插入s结点,正确的语句序列是( )。 A: p->next=s ;s->prior=p;p->next->prior=s ;s->next=p->next; B: p->next->prior=s;p->next=s;s->prior=p;s->next=p->next; C: s->prior=p;s->next=p->next;p->next=s;p->next->prior=s ; D: s->next=p->next;p->next->prior=s ;s->prior=p;p->next=s;
- 在循环双链表的P所指节点之后插入s所指节点的操作是( ) A: p->next=s; s->prior=p; p->next->prior=s; s->next=p->next; B: p->next=s; p->next->prior=s; s->prior=p; s->next=p->next; C: s->prior=p; s->next=p->next; p->next=s; p->next->prior=s; D: s->prior=p; s->next=p->next; p->next=s;p->next->prior=s;
内容
- 0
在一个单链表中,若p所指节点不是最后节点,在p之后插入s所指节点,则执行<br/>。(<br/>) A: s->next=p;p->next=s; B: s->next=p->next;p->next=s; C: s->next=p->next;p=s; D: p->next=s;s->next=p;
- 1
在单链表中，将s所指节点插入到p所指节点之后，其语句应为（ ） A: s->next = p+1; p->next=s; B: (*p).next=s; (*s).next=(*p).next; C: s->next=p->next;p->next=s->next; D: s->next=p->next; p->next=s;
- 2
在循环双链表的 p 所指的结点之前插入 s 所指结点的操作是( ) A: p->prior = s ; s->next = p ; p->prior->next = s ; s->prior = p->prior B: p->prior = s ; p->prior->next = s ; s->next = p ; s->prior = p->prior C: s->next = p ; s->prior = p->prior ; p->prior = s ; p->prior->next = s D: s->next = p ; s->prior = p->prior ; p->prior->next = s ; p->prior = s
- 3
在循环双链表的p所指的结点之前插入s所指结点的操作是（ ）。 A: p->prior = s ;s->next = p ;p->prior->next = s ;s->prior = p->prior B: p->prior = s ;p->prior->next = s ;s->next = p ;s->prior = p->prio C: s->next = p ;s->prior = p->prior ;p->prior = s ;p->prior->next = s D: s->next = p ;s->prior = p->prior ;p->prior->next = s ;p->prior = s
- 4
在循环双链表的p所指向结点之后插入结点s的操作步骤是（ ）。 A: p->next=s; s->prior=p; p->next->prior=s; s->next=p->prior; B: p->next=s; p->prior->next=s；s->prior=p; s->next=p->next; C: s->prior=p; s->next=p->next; p->next=s; p->next->prior=s; D: s->prior=p; s->next=p->next; p->next->prior=s; p->next =s;