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.
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.
举一反三
- 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
- 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
- In a doubly linked list, each node has links to the previous and next nodes in the list. A: 正确 B: 错误
- 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
- linked list