A: 正确
B: 错误
举一反三
- Which one of the following is not a characteristic of the linked list? A: The node in a linked list can be accessed randomly B: Inserting or deleting a node in a linked list do not need to move the other nodes C: Don't have to estimate storage space in advance D: The memory space required by a linked list is in proportion to the length of the list.
- 6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option. A: doubly linked circular list with a head node B: singly linked list C: singly linked circular list with a tail pointer D: singly linked circular list
- Which<br/>of the following operations is performed more efficiently by doubly<br/>linked list than by linear linked list? () A: Deleting<br/>a node whose location is given B: Searching<br/>an unsorted list for a given item C: Inserting<br/>a node after the node with a given location D: Traversing<br/>the list to process each node
- In the adjacency list of a directed graph, the number of nodes in each vertex singly linked list is equal to of the vertex. A: out_degree B: in_degree C: degree D: nothing
- 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;
内容
- 0
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
- 1
单选题 The () is a pointer that identifies the next element in the linked list. A: link B: node C: array D: a or b
- 2
In a singly linked list which operation depends on the length of the list.( ) A: Interchange the first two elements of the list B: Delete the first element of the list C: Add an element before the first element of the list D: Delete the last element of the list
- 3
Consider an implementation of unsorted singly linked list. Suppose it has representation which a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?(I). Insertion at the front of the linked list.(II). Insertion at the end of the linked list.(III). Deletion of the front node of the linked list.(IV). Deletion of the last node of the linked list. A: I, II, and IV B: I and II C: I, II, and III D: I and III
- 4
You<br/>are given pointers to first and last nodes of a singly linked list,<br/>which of the following operations are dependent on the length of the<br/>linked list? () A: Delete<br/>the first element B: Insert<br/>a new element as a first element C: Delete<br/>the last element of the list D: Add<br/>a new element at the end of the list