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
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)
Explanation: Since a singly linked list is used, you must first traverse all the way to the end, so the difficulty is O. (n).