Explore Curriculum Notes Playground

Loading...

Loading Curriculum...

Loading Subject...

Loading Topic...

Loading Lesson...

Data Structures and Algorithms Stack Queue

Practice Patterns Queue

Lesson 45/87

Loading Lab...

Interactive DSA Laboratory

Practice Patterns Queue

A queue is a linear data structure that follows FIFO (First-In-First-Out): enqueue at the rear, dequeue from the front.

TopicQueue Fundamentals

PatternFIFO Queue

TimeO(1) Core Operations

SpaceO(N) Total Storage

Current Step

Initialize Queue

Create an empty FIFO Queue. Insertions occur at the rear, removals at the front.

Playback Speed850ms

Timeline1 / 6

Custom Input Data

Structural Invariants

▪FIFO access pattern

▪Enqueue adds to the rear

▪Dequeue removes from the front

Invariants

⠿

A queue is a linear data structure that follows FIFO (First-In-First-Out): enqueue at the rear, dequeue from the front.

Variables

⠿

size0

front-1

rear-1

Code Tracker

:::

1void enqueue(int x) { q.push(x); }

2int dequeue() {

3 int x = q.front();

4 q.pop();

5 return x;

6}