Gate2018 cs Q12

12A queue is implemented using a non-circular singly linked list. The queue has a head pointer and tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by interesting a new node at the head and dequeue be implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?

Option : B
Explanation :
For Enqueue operation, performs in a constant amount of time (i.e., Θ(1)) So, the options B is correct.

Forgot your password?

I agree with the Terms.