Heaps (part 1): Priority Queues and Introduction to Max-Heaps
This is the first part of a two-part series on heaps. In this part I introduce the abstract data type "Priority Queue", discuss what a heap is and how we store a heap.
0:00 Priority Queues
4:25 Why we need heaps
7:49 Max-Heaps
9:34 Tree terminology
13:13 Max-Heaps continued
15:40 Storing max-heaps
19:08 Left(i), ...
21:20 Height of a heap