Which of the following operations 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 allow for random access of an element in constant time. To access an element, the list must be traversed from the beginning until the desired element is found. This makes random access in a LinkedList less efficient compared to other data structures such as arrays or hash tables.

Which of the Following Operations Is Least Efficient in a LinkedList