what is queue
It is linear data structure used to represent the linear list and permits deletion to be performed at one end of the list called the “front of the queue” and the insertions at the other end is called “rear of the queue”.
It is also called “FIFO” system and “FCFS”
FIFO = first in first out
FCFO = first come first service
There are three types of operations can be applied into a queue
inserts item at the rear of the queue. adds a thing to the queue . on the off chance that the line is full, at that point it is said to be a flood condition.
deletes item to the front element of the queue. expels a thing from the queue. The thing are flown in a similar request in which they are pushed. On the off chance that the queue is unfilled, at that point it is said to be an undercurrent condition.
the third operation empty à return true or false depending on whether or not the queue contains any element. show all components without erasure.