Queue in data structure pdf

Queue in data structures is a linear collection of different data types which follow a specific order while performing various operations. It can only be modified by the addition of data entities at one end or the removal of data entities at another. A data structure called queue stores and retrieves data in the order of its arrival. A queue is also called a FIFO list. Defining Queues. Defining Queues (Contd.) Queue is a list of elements in which an element is inserted at one end and deleted from the other end of the queue. B A E C D. A. Implementation In the standard library of classes, the data type queue is an adapter class, meaning that a queue is built on top of other data structures. The underlying structure for a queue could be an array, a Vector, an Array List, a Linked List, or any other collection. Queue interface enqueue(e): insert element e (at end of queue) dequeue(): delete and return the front of queue (the first inserted element) size(): return the number of elements in the queue isEmpty(): return true if queue is empty. 5. The queue data structure is a linear type of data structure that is used to store the elements. In this data structure elements are stored in the FIFO technique. A queue data structure used an array or linked list during its implementation. Insertion in queue occurs at the REAR end, and deletion from queue occurs at the FRONT end.