Amy M

[amyesh]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	A binary search tree is always a heap, but a heap isn't always a binary tree. The left child in a binary search tree is always less than the right child, whereas in a heap, it can be either greater than or less than, as long as it's consistent.
Could you build a heap with linked nodes?	Yes
Why is adding a node to a heap an O(log n) operation?	Because you're only traversing each level once, not each node.
Were the heap_up & heap_down methods useful? Why?	They were very useful as helper methods for the add and remove methods - the heap up and down methods could then be used in other places in the code, potentially, while also making the add and remove methods more readable. A good modular and extensible approach.

[CheezItMan]

Well done, you hit all the learning goals here. Excellent work!

[CheezItMan]

👍

[CheezItMan]

Since the additional space add causes is due to the 1 item being added to the heap and the log n recursive calls (call stack), this method's space complexity is O(log n)

[CheezItMan]

ditto