Code written in class

https://github.com/ucsb-cs24-mirza/cs24-s20-lectures/tree/master/lec-13

• Two different views of the heap : tree and array
• Operations supported by heaps
• Under the hood of heaps: min (or max), insert, delete min (or delete max)
• Applications for fast sorting