Ngoc L

[lebaongoc]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	In a BST, all nodes to the left of a parent are smaller in value than nodes to the right, in Heap, left child can be greater than the right child. The following properties only apply to a Heap, but not a Binary Search Tree: In a min-heap, every parent nodes are smaller than child nodes. In a max-heap, every parent nodes are greater than child nodes. Heap is left-complete, meaning the last level of the tree can be incomplete and it is filled from left to right
Could you build a heap with linked nodes?	yes :)
Why is adding a node to a heap an O(log n) operation?	because you only compare the number added to the parents and the number of parents is log n
Were the heap_up & heap_down methods useful? Why?	yes, these methods were usefull as they help with the add and remove methods

[CheezItMan]

Nice work. Thanks for getting this in. Note my comments on heap_down and on your space complexity overall. You need to remember that recursion incurs some space complexity.

You hit the learning goals here, well done!

[CheezItMan]

Actually due to truncation it doesn't matter if the index is even or odd.

[CheezItMan]

Remember since your heap_up and heap_down methods are recursive, you have some space complexity from use of the system stack. So space complexity is O(log n)