Consider a linked list implemented of a queue with two pointers: front and rear. What is the time needed to insert an element if the queue is of length n?

Questions by nehaj1993

Showing Answers 1 - 3 of 3 Answers

Deepika B

  • Jul 5th, 2013

It takes o(n) time

  Was this answer useful?  Yes


  • Sep 2nd, 2013

O(1). Insert element at rear.

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.


Related Answered Questions


Related Open Questions