ProgramGuru

Data Structures /

ArraysArrays4
❯

  1. 1Arrays Introduction
  2. 2Array Operations
  3. 3Time Complexity of Array Operations
  4. 4Space Complexity of Array Operations

StacksStacks4
❯

  1. 1Stacks Introduction
  2. 2Stack Operations
  3. 3Time Complexity of Stack Operations
  4. 4Space Complexity of Stack Operations

QueuesQueues4
❯

  1. 1Queues Introduction
  2. 2Queue Operations
  3. 3Time Complexity of Queue Operations
  4. 4Space Complexity of Queue Operations

Linked ListsLinked Lists2
❯

  1. 1Singly Linked List Introduction
  2. 2Doubly Linked List Introduction

TreesTrees3
❯

  1. 1Binary Tree Introduction
  2. 2Binary Search Tree (BST) Introduction
  3. 3Time Complexity of Binary Tree Operations
🔍

Queue Operations

Queues support a core set of operations that are fundamental to their First-In First-Out (FIFO) behavior. In this section, we explore the essential operations — Enqueue, Dequeue, Peek, isEmpty, Size, and Traversal — using visual step-by-step diagrams.

Enqueue Dequeue Peek isEmpty Size

1. Enqueue

The enqueue operation adds a new element to the rear (end) of the queue.

Initial Queue

{ "array": ["10", "20", "30"], "emptyIndices": [3, 4] }

Enqueue 40 to the rear

{ "array": ["10", "20", "30", "40"], "highlightIndicesGreen": [3] }
←

Updated Queue

{ "array": ["10", "20", "30", "40"], "emptyIndices": [4] }

2. Dequeue

The dequeue operation removes the front element from the queue.

Initial Queue

{ "array": ["10", "20", "30", "40"], "emptyIndices": [4] }

Dequeue 10 from the front

←
{ "array": ["10", "20", "30", "40"], "highlightIndicesRed": [0] }

Updated Queue

{ "array": ["20", "30", "40"] }

3. Peek

The peek operation returns the front element of the queue without removing it.

Current Queue:

{ "array": [10, 20, 30], "highlightIndices": [0] }

Peek Result: 10

4. isEmpty

The isEmpty operation checks whether the queue has any elements.

Queue with elements:

{ "array": [10, 20, 30], "highlightIndices": [] }

isEmpty Result: false

Empty Queue:

{ "array": [""], "emptyIndices": [0], "highlightIndices": [] }

isEmpty Result: true

5. Size

The size operation returns the number of elements currently present in the queue.

Queue with 3 elements:

{ "array": [10, 20, 30], "highlightIndices": [] }

Size Result: 3

Queue with 0 elements:

{ "array": [""], "emptyIndices": [0], "highlightIndices": [] }

Size Result: 0

Support ProgramGuru.org❯

You can support this website with a contribution of your choice.

When making a contribution, mention your name, and programguru.org in the message. Your name shall be displayed in the sponsors list.

PayPal

UPI

PhonePe QR

MALLIKARJUNA M