In a doubly linked list, which of the following operations is generally more…

In a doubly linked list, which of the following operations is generally more efficient than in a singly linked list?

  1. A.

    Deleting a node when its location is known

  2. B.

    Searching for a specific item in an unsorted list

  3. C.

    Inserting a node after a given location

  4. D.

    Traversing the list to process every node

Attempted by 728 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…