CS Degree Day 48

What I did today?

• Lecture 3: Heaps and heap sort
• Lecture 4: Binary Search Trees
• Lecture 5: BST operations - insertion, deletion, search: O(h)

Heap sort is clever. You build a max-heap, then repeatedly extract the maximum. The structure does the work for you.