3.4, due friday oct 6

difficult:

I didn't understand what heaps were before this, and understanding how the indexing on heap storage in an array works was a bit difficult.

application:

heaps are super useful. It's interesting that we can get almost the entire usefulness of a BST without the complexity of insertion and such (unless we need to sift the heap). Also, people's names for some data structures make me laugh.