在一个单链表中,删除p结点(非尾结点)之后的一个结点的操作是____________。
A. p->next=p
B. P->next->next=p->next
C. P->next->next=p
D. P->next=p->next->next
查看答案
在单链表中删除p所指结点的后继结点,该算法的时间复杂度是_________。
A. O(1)
B. O(√n)
C. O(log2n)
D. O(n)
在一个单链表中,已知q所指结点是p所指结点的前驱结点,若在q和p之间插入一个结点s,则执行( )。
A. s->next=p->next;p->next=s;
B. P->next=s->next;s->next=p;
C. Q->next=s;s->next=p;
D. P->next=s;s->next=q;
在单链表中,指针p所指元素为x的结点,实现删除x的后继的语句是( )。
A. p=p->next;
B. P->next=p->next->next;
C. P->next=p;
D. P=p->next->next;
(1) The teacher always ___________us to study hard for our future.(2) We should ___________the love of our relatives and friends.(3) As a new-century college student, we should be_____________for ourselves.(4)_________ is always in our hand, so we should work hard.(5) They carefully __________their friendship from being hurt.