Question

how insertion and deletion can be done on queues

​

Answer 1

Answer:

According to its FIFO structure, element inserted first will also be removed first. In a queue, one end is always used to insert data (enqueue) and the other is used to delete data (dequeue), because queue is open at both its ends.Insertion and deletion in queues takes place from the opposite ends of the list. The insertion takes place at the rear of the list and the deletion takes place from the front of the list. Insert operation is called push operation.

Explanation:

mark my answer brainliest please