Outline:

1. Questions?
2. Quiz #7
3. Array-based binary trees
4. Heaps
   • max-heap property
   • heap operations
   • time complexity
5. Wrap-up

What’s next

• Assignment 6 is due Wednesday
• Assignment 7 will be released Wednesday

What you should do now:

• The readings (see below)
• Finish Assignment 6

Reading assignment (to be completed by the next class):

Heaps (from today):

• Heap data structure

Priority queues and heapsort (for next time):

• Priority queue
• Heapsort