Home Modern Forums ISRO

Which of the following operations is performed more efficiently by doubly linked list than 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

Reply To:

Which of the following operations is performed more efficiently by doubly linked list than 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

Up
0
Down
::

nan