What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
O(nlogn)
O(logn)
O(n)
O(n2)
Answers
Answered by
1
Explanation:
since a singly linked list is used first you have to traverse till the end so the complexity is 0(n).8
Similar questions