Tatiana - sorry it's so late!

[tatsqui]

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
How is a Heap different from a Binary Search Tree?	A heap's parent-child node relationship is slightly different than a bst. For example in a min-heap the parent node is always smaller. It is a left-right balancing tree. Whereas with binary search you are always guaranteed that the left values are always smaller than the right node values... which isn't always the case for heaps.
Could you build a heap with linked nodes?	Yes it is possible, I've never done it and I have been told by a great instructor named Chris that it's quite difficult.
Why is adding a node to a heap an O(log n) operation?	Because of the tree traversal required.
Were the heap_up & heap_down methods useful? Why?	Yes, they are what enforce the parent-child relationship and make it possible to easily implement the data structure using an array.

[CheezItMan]

Not bad, take a look at my comments and let me know what questions you have. In particular when you heap up and down you need to compare the values involved to make sure if you need to swap or not.

[CheezItMan]

You can take out pry when submitting things.

[CheezItMan]

It's actually O(n log n) which is because you're adding n elements to the heap which each take log n time. Then you remove n elements which takes log n time each.

[CheezItMan]

Since you're creating a heap and building it up. This is O(n) space complexity.

[CheezItMan]

You should always compare the element at index with child_index_left. This applies every place in the heap.