Start speaking a new language. It’s just 3 weeks away.
Learn Backend Development Part-Time, Online
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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