Question

Which operationc an be perfomed efficiently on doubly lonked list?

Answer 1

Answer:

The delete operation in DLL is more efficient if pointer to the node to be deleted is given. 3) We can quickly insert a new node before a given node. In singly linked list, to delete a node, pointer to the previous node is needed. To get this previous node, sometimes the list is traversed.

Answer 2

Answer:

by deleting a node whose location in given

plz mark me as brainalist