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
- Definition of a Queue
- Applications of queue data structures
- 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
- Determining if a Queue can be sorted into another Queue
- Applying BFS to graphs
- Level-order tree traversal
- Reversing a path in a Binary Search Tree
- Constructing a complete binary tree
- Programming page replacement algorithms
- Verifying the completeness of a binary tree
- Zigzag tree traversal
- Comparing FIFO and LIFO
Queue Operations
- Reversing a Queue
- Merging the first half of the Queue with the second half
- Sorting a Queue without additional space
Additional Queue Operations
- Spiral form level-order traversal
- Finding the largest and smallest multiples
- Iterative approach to determining binary tree height
- Implementing priority queues using comparators in Java
- Calculating the maximum level sum in a binary tree
- Using a queue-based approach to find the first non-repeating character in a stream
Summary and Next Steps
Requirements
- Fundamental understanding of object-oriented programming.
Target Audience
- Developers
7 Hours
Testimonials (2)
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.
