Jessica

[jessicacaley]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	They are both binary trees, but are organized differently: a heap node's children are always smaller than a node, and a binary tree node's children have one smaller and one larger node as children.
Could you build a heap with linked nodes?	Yes, but it would be much different efficiency because you can't access the nodes by index but also things like removing from the beginning are more efficient in a linked list.
Why is adding a node to a heap an O(log n) operation?	Because you only have to hit each level of the tree once and the tree is guaranteed to be balanced so more nodes on the tree increase the complexity logarithmically instead of linearly.
Were the heap_up & heap_down methods useful? Why?	Yes, very! It helped me understand the steps of what was happening and why for adding and removing nodes, and allowed for recursion to simpify the implementation.

[CheezItMan]

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

[CheezItMan]

Since you are making at most log n swaps to add something to a heap, the time complexity is O(log n)

[CheezItMan]

Nicely done!