Adding or removing an element at an arbitrary iterator position in a singly linked list of length n takes ____ time. A) O(n) B) O(log n) C) O(1) D) O(n²)

Question

Quizplus · Accepted Answer

Adding or removing an element at an arbitrary iterator position in a singly linked list of length n takes O(1) time because it only requires updating the pointers of the nodes around the insertion or deletion point.

Adding or Removing an Element at an Arbitrary Iterator Position