Get in Touch

Course Outline

Introduction

  • What is a Queue?
  • Applications of Queue Data Structures
  • Priority Queues, Deques, and Circular Queues

Queue Implementation

  • Implementing a Queue using Stacks
  • Implementing an LRU Cache
  • Implementing a Stack using Queues
  • Implementing a Deque
  • Priority Queues

Standard Queue Problems

  • Verifying if a Queue can be sorted into another Queue
  • Using BFS for a graph
  • Level-order tree traversal
  • Reversing a path in a Binary Search Tree (BST)
  • Constructing a complete binary tree
  • Page replacement algorithms
  • Checking the completeness of a binary tree
  • Zigzag tree traversal
  • FIFO vs. LIFO

Operations on Queues

  • Reversing a Queue
  • Interleaving the first half of the Queue with the second half
  • Sorting a Queue without extra space

Additional Queue Operations

  • Level-order traversal in spiral form
  • Finding the largest and smallest multiples
  • The iterative method for determining the height of a binary tree
  • Implementing a priority queue using a comparator in Java
  • Finding the maximum level sum in a binary tree
  • Queue-based approach for identifying the first non-repeating character in a stream

Summary and Next Steps

Requirements

  • Basic knowledge of object-oriented programming language

Audience

  • Developers
 7 Hours

Number of participants


Price per participant

Testimonials (2)

Upcoming Courses

Related Categories