Cyndi

[cyndilopez]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	A heap is different in that the nodes are not sorted so that the values smaller than the root are on the left, and larger on the right. Rather, they are sorted by levels, with values greater or smaller than their parent (depending on whether it's a max or min heap).
Could you build a heap with linked nodes?	Yes, definitely!
Why is adding a node to a heap an O(log n) operation?	It's an O(log n) operation because when "heaping" up, we're only checking half of the tree.
Were the heap_up & heap_down methods useful? Why?	They were useful in sorting the nodes after a node was added.

[CheezItMan]

Well done, you hit all the learning goals here.

[CheezItMan]

Nice work with the constant space complexity solution.

[CheezItMan]

Since you are only adding one item to the heap and use an iterative heap_up method, this is actually constant.