Assume that the linked list implementation includes a reference to the last node as well as to the first node.Which of the following statements about the efficiency of a singly linked list is NOT correct?
A)Adding an element to the middle of a linked list using an iterator is O(1).
B)Removing the last element from a linked list using an iterator is O(1).
C)Accessing an element in a linked list using an iterator is O(n).
D)Adding an element to the end of a linked list is O(1).

Question

Quizplus · Accepted Answer

The Answer of Assume that the linked list implementation includes a reference to the last node as well as to the first node.Which of the following statements about the efficiency of a singly linked list is NOT correct?
A)Adding an element to the middle of a linked list using an iterator is O(1).
B)Removing the last element from a linked list using an iterator is O(1).
C)Accessing an element in a linked list using an iterator is O(n).
D)Adding an element to the end of a linked list is O(1).

Assume That the Linked List Implementation Includes a Reference to the Last