Next: November lecture summary
Up: October lecture summary
Previous: October 29
October 31
- Finish
- Begin Trees, Part
III.
- Complexity of HeapSort
- Begin Trees, Part
IV
- Tree traversals: PreOrder, PostOrder, InOrder
- Complexity of traversals
- Midterm review
Danny Heap
2002-12-13