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分别指向如图所示结点。 则不能将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;
- 在一个链表中，要把s所指的一个结点插入到p所指的一个结点后面去，正确的语句是： 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所指节点的操作是( ) 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;
- 在循环双链表的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;
- 在非空双向链表中,若要在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;
内容
- 0
在一单链表中,删除指针p所指的后继结点,以下语句正确的是() A: p=p-> next; B: s=p-> next;p-> next=s- <br/>>next;free (s) ; C: free (p-> next) ;p- <br/>>next=p-> next-> next; D: p-> next=p-> next- <br/>>next; free (p-> next) ;
- 1
在双向链表存储结构中，删除p所指的结点时须修改指针（） A: （p->prior)->next=p->next;（p->next）->prior=p->prior; B: p->prior=（p->prior）->prior;（p->prior）->next=p; C: (p->next）->prior=p;p->rlink=（p->next）->next; D: p->next=（p->prior）->prior;p->prior=（p->next）->next
- 2
在一个单链表中， 若删除 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;
- 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->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
- 4
在循环双链表的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