Next: October 31
Up: October lecture summary
Previous: October 28
October 29
- Begin Trees, Part
III.
- Insertion into a heap using
bubble_up
- Remove the largest key from a key using
bubble_down
- Array implementation of a heap
- Complexity of insertion and deletion from a heap
- Building a heap (aka heapifying an array)
- Complexity of building a heap
- HeapSort
Danny Heap
2002-12-13