11. For a singly linked list with the head node and head pointer is head, The condition for judging that the table is empty is ()
A. s->next=p->next;p->next=s;
B. p->next=s;s->next=p->next;
C. p->next=s;p->next=s->next;
D. p->next=s->next;p->next=s;
查看答案
12. Merge two ordered tables with n elements into one ordered table, and the minimum number of comparison is ().
A. n
B. 2n-1
C. 2n
D. n-1
13. If the most common operation of a table is to insert a node after the last node or delete the last node. Then, the storage method of () is adopted to save the operation time.
A. doubly linked circular list with a head node
B. singly linked lsit
C. doubly linked list
D. singly linked circular list
14. The characteristic of the tail node P of the linked circular list H is ().
A. P->next=H
B. P->next= H->next
C. P=H
D. P=H->next
15. Two pointers, P and Q, point to two elements of the singly linked list respectively. The condition that the element P refers to is the precursor of the element Q refers to is ().
A P->next==Q
B P->next==Q->next
C Q->next==P
D P==Q