Which of the following operations is performed more efficiently by doubly…

In a singly linked list, each node contains a pointer to the next node only. To delete a specific node when given its location, you typically need access to the previous node's pointer. If only the target node is known, finding the previous node requires traversing from the head, taking O(n) time. In a doubly linked list, each node has pointers to both the next and previous nodes. Therefore, given a pointer to a node, you can directly access its predecessor in O(1) time and update the pointers accordingly to delete it. Thus, deleting a node whose location is given is more efficient in a doubly linked list.