• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

ISRO | ISRO CS 2008 | Question 69

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

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments