Question

Write an algorithm to implement insertion operation of queue.

Answer 1

1. Start.
2. If both front and rear are -1, increment both by 1; otherwise increment rear by 1.
3. Store the new element at queue[rear].
4. Print Item Inserted.
5. Stop.