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 the 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
- Determining if a Queue can be sorted into another Queue.
- Applying BFS for graphs.
- Level-order tree traversal.
- Reversing a path in a Binary Search Tree (BST).
- Constructing a complete binary tree.
- Implementing page replacement algorithms.
- Checking the completeness of a binary tree.
- Zigzag tree traversal.
- Distinguishing 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 using extra space.
Additional Queue Operations
- Level-order traversal in spiral form.
- Finding the largest and smallest multiples.
- Iteratively determining the height of a binary tree.
- Implementing a Priority Queue using comparators in Java.
- Finding the maximum level sum in a binary tree.
- Using a queue-based approach to identify the first non-repeating character in a stream.
Summary and Next Steps
Requirements
- Fundamental knowledge of object-oriented programming languages.
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.
