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
- Defining 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 Challenges
- Verifying if a Queue can be reordered 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
- Developing Programs for Page Replacement Algorithms
- Checking the Completeness of a Binary Tree
- Zigzag Tree Traversal
- Contrasting FIFO and LIFO Mechanisms
Queue Operations
- Reversing a Queue
- Merging the First Half of a Queue with its Second Half
- Sorting a Queue without Utilizing Extra Space
Additional Queue Operations
- Spiral Form Level Order Traversal
- Identifying the Largest and Smallest Multiples
- Calculating the Height of a Binary Tree via Iteration
- Implementing Priority Queues in Java using Comparators
- Finding 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.
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.
