Get in Touch

Course Outline

Introduction

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

Queue Implementation

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

Standard Queue Problems

  • Checking if a Queue can be sorted into another Queue
  • Using BFS for a graph
  • Level-order tree traversal
  • Reversing a path in a BST
  • Constructing a complete binary tree
  • Page replacement algorithms program
  • 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 multiple
  • The 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 for finding the first non-repeating character in a stream

Summary and Next Steps

Requirements

  • Basic knowledge of an object-oriented programming language

Audience

  • Developers
 7 Hours

Custom Corporate Training

Training solutions designed exclusively for businesses.

  • Customized Content: We adapt the syllabus and practical exercises to the real goals and needs of your project.
  • Flexible Schedule: Dates and times adapted to your team's agenda.
  • Format: Online (live), In-company (at your offices), or Hybrid.
Investment

Price per private group, online live training, starting from 1300 € + VAT*

Contact us for an exact quote and to hear our latest promotions

Testimonials (2)

Provisional Upcoming Courses (Contact Us For More Information)

Related Categories