What is the time complexity of enqueue and dequeue in a queue using a linked list?

Question

Accepted Answer

(C) O(1) and O(1). Explanation: With a tail pointer, both enqueue (add to tail) and dequeue (remove from head) are O(1).