Course Outline
Introduction
- What is a Queue?
- Queue data structure applications
- Priority Queue, Deque, and Circular Queue
Queue Implementation
- Implementing Queue using Stacks
- Implementing LRU cache
- Implementing Stack using Queues
- Implementing Deque
- Priority Queues
Standard Queue Problems
- Checking if the Queue can be sorted into another Queue
- Using BFS for a graph
- Level order tree traversal
- Reversing a path in BST
- Constructing a complete binary tree
- page replacement algorithms program
- Checking completeness of 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 an extra space
Other Queue Operations
- Level order transversal in spiral form
- Finding the largest and smallest multiple
- The iterative method of finding the height of the binary tree
- Implementing priority queue through comparator in Java
- Finding the maximum level sum in binary tree
- Queue-based approach for the first non-repeating character in a stream
Summary and Next Steps
Requirements
- Basic knowledge of object-oriented programming language
Audience
- Developers
Testimonials (5)
Avoir déjà le code des exercices, cela permet de mieux se concentrer sur les points importants à comprendre et retenir, en étant disponible pour poser les questions.
Carole Roux - INRAE
Course - EBX5 for Developers
The variety of the information shared and the clarity to explain terms in plain English.
Arisbe Mendoza - Fairtrade International
Course - GDPR Workshop
wiedza, wzorcowe prowadzenie szkolenia
Krzysztof Kantorski - Santander
Course - Oracle GoldenGate
It's a hands-on session.
Vorraluck Sarechuer - Total Access Communication Public Company Limited (dtac)
Course - Talend Open Studio for ESB
The ability to Engauge on a 1:1 basis and ensure I had clarity and understanding on the concepts discussed.