LINK: https://we.tl/t-yD4HsdMeXKEMc26

 

Queue Data Structures Queue is also an abstract data type or a linear data structure, in which the first element is inserted from one end called REAR(also called tail), and the deletion of exisiting element takes place from the other end called as FRONT (also called head). This makes queue as FIFO data structure, which means that element inserted first will also be removed first. The process to add an element into queue is called Enqueue and the process of removal of an element from queue is called Dequeue. enqueue() operation REAR dequeue() operation FRONT enqueue() is the operation for adding an element into Queue. dequeue() is the operation for removing an element from Queue. QUEUE DATA STRUCTURE Basic features of Queue Like Stack, Queue is also an ordered list of elements of similar data types. 1. Queue is a FIFO( First in First Out) structure. 2. Once a new element is inserted into the Queue, all the elements inserted before the new element in the queue must be removed, to remove the new element. 3. peek() function is oftenly used to return the value of first element without dequeuing it.