Question

Time required to delete a node a x from the a doubly linked list having n nodes is

Answer 1

zero of one

The time required to delete a node x from a doubly linked list having n nodes is O(1). Doubly linked list is a sequence of elements in which every node has link to its previous node and next node. Traversing can be done in both directions and displays the contents in the whole list.