In a doubly linked list containing n elements, how much time will it take to…
In a doubly linked list containing n elements, how much time will it take to find the 4th node from the end, assuming only a pointer to the head of the list is available?
- A.
O(n2)
- B.
O(n)
- C.
O(n log n)
- D.
O(1)
Attempted by 694 students.
Sign up free to check your answer
Sign up freeLoading lesson…

