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?
- A.
Deleting a node when its location is known
- B.
Searching for a specific item in an unsorted list
- C.
Inserting a node after a given location
- D.
Traversing the list to process every node
Attempted by 728 students.
Sign up free to check your answer
Sign up freeLoading lesson…

