Get in Touch

Course Outline

Introduction

  • What is a Queue?
  • Applications of the queue data structure
  • Priority Queue, Deque, and Circular Queue

Implementing Queues

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

Common Queue Problems

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

Queue Operations

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

Additional Queue Operations

  • Level-order traversal in spiral form
  • Finding the largest and smallest multiples
  • Iterative method for finding 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 to finding the first non-repeating character in a stream

Summary and Next Steps

Requirements

  • Foundational knowledge of object-oriented programming languages

Target Audience

  • Developers
 7 Hours

Number of participants


Price per participant

Testimonials (2)

Upcoming Courses

Related Categories