Tag: what is queue in data structure

Deque, double ended queue is an abstract data type in which elements can be added or removed either from front or back. Generally Front is considered as head end and Back is considered as Tail end.

Circular queue is modified version of Queue data structure, that adheres FIFO principle. It has fixed memory size, due to which it permits better memory utilization compare to simple queue.

Queue in Data Structure is a list in which elements have a linear data structure where items get inserted from one end and deleted from another end. Insertion end is considered as rear and deletion end is considered as front end of queue.