7. The pointer in the static linked list represents ().
A. the address of the next element
B. memory address
C. array subscript
D. address of the left child and the right child
查看答案
8. If the linear table with length n uses the sequential storage structure, the time complexity of the algorithm of inserting a new element in its ith position is ().
A. O(n)
B. O(0)
C. O(1)
D. O(n^2)
9. For the sequence table, the time complexity of accessing and deleting nodes are ().
A. O(1) O(n)
B. O(n) O(n)
C. O(n) O(1)
D. O(1) O(1)
10. Insert the node whose pointer is S after the node whose pointer is P in the singly linked list. The correct operation 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;
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;