What is a Queue?

This lesson gives an introduction to the queue data structure, its various uses, and types. We will also go through the inner workings of a Queue by briefly discussing each of its functions.

We'll cover the following

Introduction
What are Queues used for?
How do Queues work?
Types of Queues
- Circular Queue
- Priority Queue

Introduction #

Similar to the Stack, a Queue is another linear data structure that stores the elements in a sequential manner. The only significant difference between Stack and Queue is that instead of using the LIFO principle, Queue implements the FIFO method which is short for First in First Out.

According to FIFO, the first element inserted is the one that comes out first. You can think of a queue as a pipe with both ends open. Elements enter from one end (back) and leave from the other (front). The following animation illustrates the structure of a queue.

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy

Introduction to Complexity Measures

Introduction to Arrays

Introduction to Linked Lists

Introduction to Stack/Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

What is a Queue?

Introduction #