Thank you for sending your enquiry! One of our team members will contact you shortly.
Thank you for sending your booking! One of our team members will contact you shortly.
Course Outline
Introduction
- Understanding what a Queue is.
- Applications of the queue data structure.
- Exploration of Priority Queues, Deques, and Circular Queues.
Queue Implementation
- Implementing a Queue using Stacks.
- Building an LRU cache.
- Implementing a Stack using Queues.
- Implementing a Deque.
- Working with Priority Queues.
Standard Queue Problems
- Verifying if a Queue can be sorted into another Queue.
- Applying BFS to a graph.
- Performing level-order tree traversal.
- Reversing a path in a Binary Search Tree (BST).
- Constructing a complete binary tree.
- Programming page replacement algorithms.
- Checking the completeness of a binary tree.
- Executing zigzag tree traversal.
- Differentiating between FIFO and LIFO.
Operations on Queue
- Reversing a Queue.
- Interleaving the first half of the Queue with the second half.
- Sorting a Queue without requiring extra space.
Additional Queue Operations
- Performing level-order traversal in a spiral pattern.
- Finding the largest and smallest multiples.
- Using the iterative method to determine the height of a binary tree.
- Implementing a priority queue via a comparator in Java.
- Identifying the maximum level sum in a binary tree.
- Utilizing a queue-based approach to find the first non-repeating character in a stream.
Summary and Next Steps
Requirements
- Fundamental knowledge of an object-oriented programming language.
Audience
- Developers.
7 Hours
Testimonials (3)
the trainer knows their subject well
Pascal - NOOUS pour Atos/Eviden
Course - EBX5 for Developers
Machine Translated
The variety of the information shared and the clarity to explain terms in plain English.
Arisbe Mendoza - Fairtrade International
Course - GDPR Workshop
It's a hands-on session.
