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²)

Name: 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 2 )
Brand: Quizplus
Rating: 4.9 (35 reviews)

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 the iterator provides direct access to the node at that position.

Adding or Removing an Element at an Arbitrary Iterator Position