In queues, the items deleted at one end is called -
In queues, the items deleted at one end is called front.
Queue is an abstract data type or a linear data structure, in which the first element is inserted from one end called the rear, and the removal of existing element takes place from the other end called as front.