Question

In a linked chain implementation of a queue, the performance of the enqueue operation

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

Answer 1

A.O(1)

Step-by-step explanation:

In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.