Angela

[AngelaOh]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	Heaps are filled from left to right within each level. The parent node is always smaller than its children in a min heap while the opposite is true for a max heap.
Could you build a heap with linked nodes?	You probably shouldn't because having access to an array's index helps the time complexity a lot.
Why is adding a node to a heap an O(log n) operation?	You are looking at each level of the heap.
Were the heap_up & heap_down methods useful? Why?	YES. You need heap_up when adding to a heap and heap_down when you are removing. They are recursive helper methods.

[CheezItMan]

Nice work! You hit all the learning goals here. Well done.

[CheezItMan]

Great!