08. Heaps and Applications

This is the eighth short course – Heaps and Applications – of the Master Series on the Analysis of Algorithms. In this course, you’ll explore binary heaps and their wide range of applications, including priority queue implementations. You’ll also learn about the Union-Find data structure and its role in efficiently managing disjoint sets, as well as practical applications like disk external sorting using priority queues.