题目内容

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

查看答案

16. In a doubly linked list, the operation to delete a node after the node p is ().

A. p->next=p->next->next; p->next->next->prior=p;
B. p->next->prior=p; p->next=p->next->next;
C. p->next=p->next->next; p->next->prior=p;
D. p->next->next=p->next; p->next->prior=p;

查看答案

17. When a linear table is stored in () mode, it cannot access all other nodes from any node in the table.

A. singly linked lsit
B. doubly linked list
C. singly linked circular list
D. doubly linked circular list

查看答案

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 ().

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 ().

16. In a doubly linked list, the operation to delete a node after the node p is ().

17. When a linear table is stored in () mode, it cannot access all other nodes from any node in the table.

A. doubly linked circular list with a head node
B. singly linked lsit
C. doubly linked list
D. singly linked circular list