- created a binary heap and some functions to go with it
- used this link as a guide: http://robin-thomas.github.io/min-heap/
- also used this: http://interactivepython.org/runestone/static/pythonds/Trees/BinaryHeapImplementation.html
- and this: https://www.geeksforgeeks.org/binary-heap/
- example output:
>>> ./binary-heap
min heap: 1 3 2 7 8 4 6
Deleting node 1
min heap: 2 3 4 7 8 6
Deleting node 2
min heap: 4 3 6 7 8
Deleting node 4
min heap: 6 3 8 7
Deleting node 6
min heap: 3 7 8
Deleting node 3
min heap: 7 8
Deleting node 7
min heap: 8
Deleting node 8
min heap:
Min Heap is empty!
![[paper clip]](/cours/static/images/paper_clip_tilt.png)
