Meeting 32: Array-Based Trees and Heaps
Today we will look at array-based implementations of complete binary trees and the thier most common use case, heaps.
- Heaps
- Heap implementations of priority queue
- Array-based heaps
- Extension to incomplete trees
Links