In a doubly linked chain implementation of a queue, what is the performance when the dequeue operation

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

Explanation:While dequeuing operation takes place,that is the elimination of the front element from the queue.In doubled linked list/chain, the dequeue operation operates at the consecutive elements lined in the chain with O(1) time period for the eliminating the item or returning the last value from the link along with the reference.from the chain link.Therefore, the correct option is option(A).

Answer Link

In a doubly linked chain implementation of a queue, what is the performance when the dequeue operation A. O(1) B.O(n) C.O(logn) D.O(n2)

Respuesta :

Otras preguntas

In a doubly linked chain implementation of a queue, what is the performance when the dequeue operation

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)