Previous Lecture | lect15 | Next Lecture |
Code written in class
https://github.com/ucsb-cs24-mirza-s21/cs24-s21-lectures/tree/main/lect15
Topics
- 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