Table of Contents:

Plugging The Channel 0:00 - 0:36

The Problem Introduction 0:36 - 1:13

A Heap Is Not An ADT 1:13 - 1:43

The ADT Priority Queue 1:43 - 3:39

The Min and Max Heap 3:39 - 5:50

Insertions & Removals On A Min Heap 5:50 - 8:57

Our First Removal 8:57 - 11:16

Continue Insertions 11:16 - 13:20

Our Second Removal 13:20 - 15:21

Our Third Removal 15:21 - 15:54

Continue Insertions 15:54 - 17:47

Notice Our Heaps Contents 17:47 - 18:32

Time Complexity For Insertion & Removal 18:32 - 19:35

Wrap Up 19:35 - 20:00

Code: https://github.com/bephrem1/backtobackswe/blob/master/Sorting%2C%20Searching%2C%20%26%20Heaps/ImplementABinaryHeap/ImplementABinaryHeap.java