Version: 0.3.38
3. Binary Heaps#
- Lecture:
Lecture 5.3
(slides)
- Objectives:
Understand how to implement a binary heap
- Concepts:
Priority queue ADT, insertion, minimum extraction, heapification.
To be completed
Hi there! What do you think of this course, so far? Please, give us feedback!