Kirsten

[kanderson38]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	In a min-heap, every child is larger than its parents; in a BST, a smaller node goes to the left of its parent, and a larger node goes to the right.
Could you build a heap with linked nodes?	You could, but it's much easier to use an array.
Why is adding a node to a heap an O(log n) operation?	You compare the new node to its parent and swap until it's in the right place -- this parent/child comparison can happen up to log n times.
Were the heap_up & heap_down methods useful? Why?	They made it possible to reestablish the heap order when nodes were added or removed, so they were not just useful, but necessary.

[CheezItMan]

Great work, this is perfect. Excellent job!

[CheezItMan]

👍