Branches, Kristy

[kristyh32]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	Heaps do not differentiate that the left child is smaller than the right child, just that both children are larger/smaller than the parent. Heaps are also complete trees because they are filled from left to right.
Could you build a heap with linked nodes?	Yes, techinically, but that wouldn't be an efficient way to build a heap because you would lose the O( log n) insert/removal that you have implementing it with an array.
Why is adding a node to a heap an O(log n) operation?	It's an O(log n) operation because you add/remove from the end of the list and then you only have to heap up/heap down on half the list.
Were the heap_up & heap_down methods useful? Why?	Yes every time you add or remove you need to use the heap_up or heap_down and you can do it recursively.