Consider a linked list implemented of a queue with two pointers: front and rear.

Question

What is the order of inserting an element if the queue is of length n?

Answer 1

Few cases -
1. If it is ordered list, we can apply the binary search and insert an element o(log n).
2. If it is unordered then we can insert at whatever place we want i.e. o(1).

Answer 2

It is of order O(1),when we insert element from rear end.