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
A: I, II, and IV
B: I and II
C: I, II, and III
D: I and III
举一反三
- 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 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.
- In a doubly linked list, each node has links to the previous and next nodes in the list. A: 正确 B: 错误
- 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
- A<br/>stack is a special type of linked list in which objects can only be<br/>added to and removed from the top of the list.