Take out a piece of paper and put your name on the upper right corner.
Create a max heap (stored in an array) by inserting, in sequence, the values 7, 1, 4, 5, 6, 3, 8. Show the resulting array.
After the array, write an explanation the Big-O performance of creating the heap.
Bonus point: Describe an in-order traversal of a binary tree.
Hand in your paper when you are done.
Take a short break and be back in your seats at
Time remaining: