---- v60_heap_intro.mkv

Heaps are also called "priority queues"
Organization:  First item on top, all parents before children
Draw insert and delete

---- v61_heap_adt.mkv

We did the red/black tree with pointers
	This time:  Flat
	Means it'll be easy to save!

insert
pop

---- v62_heap_remove_and_resize

Resizing
Remove / Cancel
	Really the same as the removal part of pop
	Copy over last item, sift down
	Remember to call the destructor first!
		Our floats don't have one

---- v63_heap_destructors.mkv

Let's put in a memory test class
	It'll point to some heap memory

---- v64_heapsort_project.mkv

Project intro
How heapsort works
Project:
	1.  Implement heapsort so it works with our class sorting library
	2.  Compare it with the other algorithms, for large and small datasets