Which operations of linked list are more efficient than array based list?
A: insert
B: search
C: remove
D: setPos
A: insert
B: search
C: remove
D: setPos
举一反三
- Compared with array based list, linked list requires more memory to store elements.
- 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
- 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
- 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
- Given an empty linked list, the cost to insert n elements in the list is ___? A: Θ(1) B: Θ(n) C: Θ(n*n) D: Θ(log n)