Priority Queues with an Interlude on Heaps
Offered By: YouTube
Course Description
Overview
Dive into the world of Priority Queues (PQs) and explore their implementation using Heaps in this informative 30-minute lecture. Learn the fundamental concepts of Priority Queues, including the differences between Min Heaps and Max Heaps. Discover the techniques for inserting and removing elements from Priority Queues efficiently. Gain practical insights by examining Priority Queue code implementations, enhancing your understanding of these essential data structures and their applications in computer science and algorithm design.
Syllabus
Priority Queue Introduction.
Priority Queue Min Heaps and Max Heaps.
Priority Queue Inserting Elements.
Priority Queue Removing Elements.
Priority Queue Code.
Taught by
WilliamFiset
Related Courses
Graph Search, Shortest Paths, and Data StructuresStanford University via Coursera Ordered Data Structures
University of Illinois at Urbana-Champaign via Coursera Accelerated Computer Science Fundamentals
University of Illinois at Urbana-Champaign via Coursera Data Structures and Algorithms
Georgia Institute of Technology via edX Introduction to Data Structures & Algorithms in Java
Udemy