Branches - Kelsey

[kelsk]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	A heap maintains a parent/child relationship based on value (min-heaps have smaller parents, max-heaps have larger parents) but the sibling relationship isn't specified by smallest-to-largest values left-to-right
Could you build a heap with linked nodes?	You could, but that seems unnecessarily complex when an array can keep a heap's order just fine.
Why is adding a node to a heap an O(log n) operation?	We are traversing the number of levels in the heap (log n) not the number of nodes in the heap (n)
Were the heap_up & heap_down methods useful? Why?	Yes, they were a quick and accurate way to determine the correct new location of nodes when adding/removing them.