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 the linked list is correct?
A)Adding an element to the middle of the linked list at the current position of the iterator is O(n).
B)Removing an element other than the last element from the linked list at the current position of the iterator is O(n).
C)Accessing an element in the linked list using an iterator is O(n).
D)Adding an element to the end of the linked list is O(1).

Question

Quizplus · Accepted Answer

The Answer is D

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