1.

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list(A) Deleting a node whose location is given.(B) Searching of an unsorted list for a given item.(C) Inserting a new node after node whose location is given.(D) Traversing the list to process each node. 

Answer»

Correct option- (A) Deleting a node whose location is given. 



Discussion

No Comment Found

Related InterviewSolutions