Mira

[calopter]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	it has looser ordering
Could you build a heap with linked nodes?	sure
Why is adding a node to a heap an O(log n) operation?	because the heap is a complete binary structure, worst case is heaping a new element to the bottom row, which is the height of the tree number of swaps, which is logn
Were the heap_up & heap_down methods useful? Why?	they separate concerns (and recursion) out of the add and remove methods