Which of the following operations is performed more efficiently by doubly linked list then by linear linked list?
- A. Deleting a node whose location is given
- B. Searching an unsorted list for a given item
- C. Inserting a node after the node with a given location
- D. Traversing the list to process each node
Answer: A. Deleting a node whose location is given
Explanation: In a doubly linked list, we can access the previous node directly to update links. In a singly list, we need to traverse from head.