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)

A.O(1)

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.

i think the answer is b.

answerstandard;