Question

What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?​

Answer 1

Answer:

mrk me as brainliest plzzzz

Explanation:

7. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

a) O(nlogn)

b) O(logn)

c) O(n)

d) O(n2)

Answer: c

Explanation: Since a singly linked list is used, first you have to traverse till the end, so the complexity is O(n).