Question

Write an algorithm to implement deletion operation of queue.

Answer 1

1. Start.
2. If front = -1, print Queue Empty and stop.
3. Store queue[front] as the deleted item.
4. If front = rear, set both to -1; otherwise increment front by 1.
5. Print Item Deleted.
6. Stop.