Skip to content

Conversation

@yesentorres
Copy link

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? BSTs are ordered in such a way that everything to the left of a root is smaller than the root and everything to the right is larger. There are two types of heaps, MinHeaps and MaxHeaps. In a MinHeap every parent node is less than its child nodes and in a MaxHeap every parent node is greater than its child nodes.
Could you build a heap with linked nodes? Yes.
Why is adding a node to a heap an O(log n) operation? Adding a node will at worst-case perform 1 swap per level of the heap, which would take up to O(log n) swaps.
Were the heap_up & heap_down methods useful? Why? Yes, helped keep methods simple by divvying up major tasks.

@yesentorres yesentorres reopened this Sep 30, 2020
Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Yesenia, you hit the learning goals here. Do take a look at my notes on time complexity with Heapsort. Otherwise well done.

Comment on lines +2 to 5
# Time Complexity: O(n)
# Space Complexity: O(n)

def heapsort(list)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You are adding n items to a heap and each add takes log n time. Then you remove with the same time complexity.

So your time complexity is O(n log n), which is as fast as you can sort a generic list.

Comment on lines +17 to 19
# Time Complexity: O(log n)
# Space Complexity: O(log n)
def add(key, value = key)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +27 to 29
# Time Complexity: O(log n)
# Space Complexity: O(log n)
def remove()

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +58 to 60
# Time complexity: O(1)
# Space complexity: O(1)
def empty?

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +69 to 71
# Time complexity: O(log n)
# Space complexity: O(log n)
def heap_up(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

# This helper method takes an index and
# moves it up the heap if it's smaller
# than it's parent node.
def heap_down(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants