A queue or FIFO (first in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: enqueue, the process of adding an element to the collection.(The element is added from the rear side) and dequeue, the process of removing the first element that was added. (The element is removed from the front side). It can be implemented by using both array and linked list.
Popular Articles on Queue
- Queue Introduction and Array Implementation
- Linked List Implementation of Queue
- Applications of Queue Data Structure
- Priority Queue Introduction
- Deque (Introduction and Applications)
- Implementation of Deque using circular array
- Implement Queue using Stacks
- Check whether a given Binary Tree is Complete or not
- Find the largest multiple of 3
- Find the first circular tour that visits all petrol pumps
- Maximum of all subarrays of size k
- An Interesting Method to Generate Binary Numbers from 1 to n
- How to efficiently implement k Queues in a single array?
- Minimum time required to rot all oranges
- Iterative Method to find Height of Binary Tree
- Construct Complete Binary Tree from its Linked List Representation
- Implement LRU Cache
- Breadth First Traversal for a Graph
- Implement a stack using single queue
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.