Compared with array based list, linked list requires more memory to store elements.
举一反三
- Which operations of linked list are more efficient than array based list? A: insert B: search C: remove D: setPos
- 单选题 () is a fixed-size, sequenced collection of elements of the same data type. A: An array B: A record C: A linked list D: A variable
- 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.
- 7. The pointer in the static linked list represents (). A: the address of the next element B: memory address C: array subscript D: address of the left child and the right child
- 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)