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

💬 Discuss

✅ Correct Answer: (A) deleting a node whose location in given

Published by Mr. Dubey ⭐ 111.42K Points at 13-Sep-2023 11:24 am in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

614

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate