Skip to main content
C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle
SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs
Beginner 8 planned topics Algorithms

Introduction to Queue

Learn the queue data structure: FIFO, deque, and BFS. Free queue introduction.

Learning Outcomes

  • Implement enqueue and dequeue
  • Explain FIFO with a real-life example
  • See why BFS uses a queue
  • Know deque as a double-ended variant

Overview

A queue is first-in, first-out. Enqueue and dequeue model printers, tickets, and BFS.

This page also mentions deque and circular queues as interview follow-ups.

Compare it with stack so you never mix the two in an interview.

What this course will cover

  1. 1. FIFO
  2. 2. Array queue
  3. 3. Linked queue
  4. 4. Circular queue
  5. 5. Deque
  6. 6. BFS idea

Start a complete tutorial now

Full 6-level lessons are live for C, C++, Java, Python, and JavaScript. Use them while the remaining Queue lessons are added.

← All technology tutorials