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
- What is a Queue?
- Applications of the Queue data structure
- 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 whether a Queue can be sorted into another Queue
- Using BFS for graph traversal
- 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
- FIFO vs 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
Other 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
- Basic knowledge of object-oriented programming languages
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.
