Heaps and Priority Queues

About this course

Binary heaps, heap operations, heapsort, priority queue applications, Fibonacci heaps.

• 20 lessons
• 2 h
• intermediate

What you'll learn

• Describe the course roadmap and learning outcomes
• Define a priority queue and distinguish it from a standard queue
• Identify real-world scenarios where priority queues are essential
• Define a binary heap and its two key properties
• Represent a binary heap as an array and map indices to tree relationships
• Differentiate between min-heaps and max-heaps

Finishing the course

• 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
• Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.

Created by