Jansen

[JansenMartin]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	Heaps guarantee elements on higher levels are either greater or lower than elements at lower levels. Binary Search Trees guarantee order from left to right. Heaps are better for finding min/max values, while Binary Search Trees are better for sorting elements.
Could you build a heap with linked nodes?	Yes, but it's much easier to implement a heap with an array. Why? Because indexes can be used to determine the parent or children of a given element.
Why is adding a node to a heap an O(log n) operation?	Because the heap must satisfy the "heap-order" property. That means, when adding a node, you must go through the heap to ensure parents are either greater (max-heap) or less than (min-heap) their children. n stands for the number of levels within the tree.
Were the heap_up & heap_down methods useful? Why?	Yes. They preserved the heap-order of the min-heap when adding/removing nodes to the heap.

[CheezItMan]

Nice work, except for the space complexity you hit the heap class well.

You don't have heapsort here. So... that's missing.

[CheezItMan]

Since you have a recursive heap_up method, you have to consider the space complexity of that method. So... this is actually O(log n).

The same applies for all your recursive methods.