Q38
Which of the following operations requires O(n) time in a doubly linked list?
A.
Accessing an element by index
B.
Deleting a node at the end
C.
Inserting a node at the beginning
D.
Traversing the list
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board