Which of the following operations is carried out more efficiently by the doubly-linked list than by the

Question:

Which of the following operations is carried out more efficiently by the doubly-linked list than by the singly-linked list?

A. Deleting a node whose location in given 

B. Searching of an unsorted list for a given item 

C. Inverting a node after the node with given location 

D. Traversing a list to process each node

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: