Priority Queues and Heaps

Welcome to week 3!

Learning objectives

By the end of this week, you will be able to:

• Describe how the heap structure allows efficient insertion and deletion of elements while maintaining its ordering property.
• Trace, compare, and contrast heapsort with other sorting algorithms.
• Implement solutions to problems by applying priority queues and heaps.

What's due this week

• Week 3 Quiz (on Gradescope), due Thursday before class starts