• 2022-06-04
    在双向链表存储结构中,删除p所指的结点时需修改指针()
    A: p→next→prior=p→prior;p→prior→next=p→next;
    B: p→next=p→next→next;p→next→prior=p;
    C: p→prior→next=p;p→prior=p→prior→prior;
    D: p→prior=p→next→next;p→next=p→prior→prior;
  • A

    举一反三

    内容

    • 0

      完成在双循环链表结点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()->()prior=p;()s()->()next=p()->()next;()p()->()next()->()prior=s();()p()->()next=s;

    • 1

      在循环双链表的p结点之后插入s结点的操作是______。 A: p→next=s;p→next→prior=s;S→prior=p;S→next=p→next; B: s→next=p;s→next=p→next;p→next=s;p→next→prior=s; C: p→next=s;s→prior=p;p→next→prior=s;s→next=p→next; D: s→prior=p;s→next=p→next;p→next→prior=s;p→next=S;

    • 2

      在双向链表存储结构中,删除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

    • 3

      在一个双链表中,在* $p$ 结点之后插入一个结点*s 的操作是[input=type:blank,size:4][/input]。 A: s-> prior =p ; p->n e x t=s ; p-> next -> prior =s ; s->n e x t=p-> next s -> next = p -> next ; B: p -> next -> prior = s ; p -> next = s ; s \rightarrow> prior = p C: p -> next = s ; s \rightarrow> prior = p ; s -> next = p -> next ; p -> next -> prior = s ; D: p -> next -> prior = s ; s -> next = p -> next ; s \rightarrow prior = p ; p -> next = s

    • 4

      在双向链表存储结构中,删除p所指的结点时须修改指针( )。 A: p->prior=p->prior->prior; p->prior->next=p; B: p->next=p->prior ->prior; p->prior=p->next->next; C: p->prior->next=p->next; p->next->prior=p->prior; D: p->next->prior=p; p->next=p->next->next;