Whichof the following operations is performed moreefficiently by doubly linkedlist than by linear linked list?

A

Deleting a node whoselocation is given

B

Searching an unsortedlist for a given item

C

Inserting a node after the node with a given location

D

Traversing the list to process each node