Lesson 1
Today we'll discuss a new data structure interface and a common encoding for that interface.
This lesson will address aspects of following goals from Group 10:
- Goal 10A: Heaps and Priority Queues:
- Recognize situations where a heap may be the most appropriate choice.
- Interpret small code examples that use a heap or priority-queue interface.
Outline
- Before You Start
- Priority Queue
- Binary Heap
- Binary Heap Insert
- PopMin
- Heapify
- HeapSort
- Surprise Amortized Complexity Practice
- Key Points
- Before You Go…
To receive credit: complete all pages above, then this page will be complete as well (and get a green check emoji at the bottom right of the page).
(When logged in, completion status appears here.)