Branches - Brianna

[brikemp]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	The distribution of a heap requires a parent's value to always be less/greater than their children, while in a binary search tree a parent with two children will always fall in the middle of the two
Could you build a heap with linked nodes?	Yes?...but it wouldn't be as efficient as using an array because you can take advantage of using indexes
Why is adding a node to a heap an O(log n) operation?	Because in the worst case scenario you would have to heap up to the top of the heap. A heap is a binary tree, so the number of levels is determined by log n
Were the heap_up & heap_down methods useful? Why?	Yes, it simplified the implementation of the public functions. It also helped me to visualize what was actually happening

[CheezItMan]

Nicely done, you hit the learning goals here. Awesome work. Do take a look at my comments on time/space complexity. Otherwise well done.

[CheezItMan]

You're adding n elements to a heap (each add is log n) and so this sort is O(n log n) time complexity.

[CheezItMan]

👍

[CheezItMan]

For space complexity are you creating any new data structures? Are you making recursive calls? If not it's O(1).

Otherwise this works.