Learning Path Blogs Premium Login

Hide Index

Queue

0% completed

Introduction to queues

Understanding the problem

Exploring a possible solution

Key properties of a queue

Overview of supported operations

Array implementation of queues

Structure of an array based queue

Cyclic nature of array based queues

Implementing the queue class using an array

Determining the size of the queue

Checking if the queue is empty

Accessing the front of the queue

Accessing the back of the queue

Enqueuing an item in the queue

Dequeuing an item from the queue

Design a queue using circular array

Linked list implementation of queues

Structure of a linked list based queue

Implementing a queue class using a linked list

Determining the size of the queue

Checking of the queue is empty

Accessing the front of the queue

Accessing the back of the queue

Enqueuing an item in the queue

Dequeuing an item from the queue

Design a queue using linked list

Pattern: Queue from Stack

Design a queue using stacks

Pattern: Stack from Queue

Design a stack using queues

Design a stack using a single queue

Pattern: Reversal

Queue inversion

Recursively reverse a queue

Pattern: Breadth-first search

Binary number generator

Smallest multiple formation

Concatenated numbers

Pattern: Deque

K negative integers

Design a deque using circular array

Design a deque using linked list

Assessments

Certificate

Liking the course? Check our discounted plans to continue learning.