What operation is least efficient in a LinkedList?
A) Adding an element in a position that has already been located.
B) Linear traversal step.
C) Removing an element when the element's position has already been located.
D) Random access of an element.

Question

Quizplus · Accepted Answer

LinkedLists do not support efficient random access because they require traversal from the head to the desired position, resulting in O(n) time complexity.

What Operation Is Least Efficient in a LinkedList