Shirley

[shirley1chu]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	The keys are in semi-order instead of complete order. Child node keys are either all less, or all greater than the parent. BST has the left side as less, right side as greater.
Could you build a heap with linked nodes?	Yes, though it's easier to do it in an array structure.
Why is adding a node to a heap an O(log n) operation?	It only needs to traverse one side of the tree (whichever side it got added on based on index)
Were the heap_up & heap_down methods useful? Why?	Heap up is useful for adding, because once a new node is added, it needs to be placed in the right position (since it gets added at the end of the heap). Heap down is good for removing elements, because the heap needs to reorder itself once the root element is removed.

[CheezItMan]

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

[CheezItMan]

Since you are making a new heap and adding all the elements, this is O(n)