Spruce- Rebecca Z

[rzuick]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	A heap is unordered
Could you build a heap with linked nodes?	Probably. Since a heap under the hood is essentially an array, and a linked list is a special type of array, I think you could.
Why is adding a node to a heap an O(log n) operation?	Because you end up searching through half of the tree to find the index to add the node
Were the heap_up & heap_down methods useful? Why?	Yes. Recursion.

[kyra-patton]

✨ Nice work! I left some comments on complexity below. Let me know what questions you have.

🟢

[kyra-patton]

✨ Space complexity is O(log n) here because of the recursive call stack

[kyra-patton]

✨ Because of the recursive call stack, space complexity is O(log n)

[kyra-patton]

✨

[kyra-patton]

✨ Because of the recursive call stack of heap_down, space complexity is O(log n)

[kyra-patton]

✨ The space complexity here is determined by the recursive call stack of heap_up which is just O(log n)

[kyra-patton]

✨ Time complexity here will be O(n log n) where n is length of list. For each of n items in list, you perform heap.add()/heap.remove() which are both log n operations.