**Problem : **
In terms of space, why is heap sort attractive?

**Problem : **
Does the following array represent a heap?

No. You can easily tell that this array does not represent a proper heap by noticing that the largest element is not in the first position (the root node).{8, 5, 9, 3, 6, 2, 1}

**Problem : **
What is the maximum depth of a heap with n elements?

log(n)

**Problem : **
Imagine that instead of using an array to represent the heap, we use a
singly linked list. Why might this be innefficient? (Hint: Consider
the insertions that must be done).

Take a Study Break!