Linked list operations that were studied included adding/removing an element at the end or in the middle, and retrieving the kth element.If the iterator is currently pointing to the correct location for insertion or removal, which of the following statements about these doubly-linked list operations is correct?
A)The most expensive operation of a doubly-linked list is to add an element at the end.
B)The most expensive operation of a doubly-linked list is to remove an element at the end.
C)The most expensive operation of a doubly-linked list is to add an element in the middle.
D)The most expensive operation of a doubly-linked list is to retrieve an arbitrary element.

Question

Quizplus · Accepted Answer

Retrieving an arbitrary element in a doubly-linked list requires potentially traversing from the head or tail to the desired position, making it the most time-consuming operation if the iterator is not already at the correct location. Adding or removing elements at the end or in the middle can be done in constant time if the iterator is already at the correct position.

Linked List Operations That Were Studied Included Adding/removing an Element