Which of the following statements about linked lists is correct?
A)When a node is removed, all nodes after the removed node must be moved down.
B)Visiting the elements of a linked list in random order is efficient.
C)Linked lists should be used when you know the correct position and need to insert and remove elements efficiently.
D)Even if you have located the correct position, adding elements in the middle of a linked list is inefficient.

Question

Quizplus · Accepted Answer

Linked lists are particularly efficient for operations that involve frequent insertion and removal of elements, especially when the position is known. This is because, unlike arrays, linked lists do not require shifting elements after the insertion or removal point. Instead, only the pointers of the nodes before and after the affected node need to be updated.

Which of the Following Statements About Linked Lists Is Correct