Leaves - Bri

[brilatimer]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	Heap only lets you provide the max or min values. BST lets you look up if a value exists (its a look-up tool).
Could you build a heap with linked nodes?	Yes, the nodes would link 2 children (like the visualization of a binary tree)
Why is adding a node to a heap an O(log n) operation?	Because only the height is being traversed.
Was the heap_up & heap_down methods useful? Why?	Yes because it allowed me to call it recursively.