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)

Explanation: Linked chain is the type of the chain that gets created through the linking of the objects.This is done by the link established between the objects/elements with the consecutive attachment. In this chain, enqueue is the operation that functions for the insertion/addition of the elements in the queue.So, while enqueuing operation takes place in a chain, it requires the O(n) time.

Answer Link

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)

Respuesta :

Otras preguntas

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)