Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Rock - Priscille #26

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Rock - Priscille #26

wants to merge 2 commits into from

Conversation

Priscillesg
Copy link

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? In a Max Heap, parent nodes are greater than child nodes. In a Min Heap, parent nodes are less than child nodes
Could you build a heap with linked nodes? Yes
Why is adding a node to a heap an O(log n) operation? We compare the node to his parent at every level. Skipping half of the elements every time we compare.
Were the heap_up & heap_down methods useful? Why? Yes

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 Pricelle, you hit the learning goals here. Well done .

Comment on lines 3 to +6
def heap_sort(list):
""" This method uses a heap to sort an array.
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(nlogn)
Space Complexity O(n):

Choose a reason for hiding this comment

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

👍 Nice work

Comment on lines 20 to +24
def add(self, key, value = None):
""" This method adds a HeapNode instance to the heap
If value == None the new node's value should be set to key
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(log n)
Space Complexity: O(1)

Choose a reason for hiding this comment

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

👍 However the space complexity is O(log n) due to heap_up function's recursive call stack.

Comment on lines 34 to 39
def remove(self):
""" This method removes and returns an element from the heap
maintaining the heap structure
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(log n)
Space Complexity: O(1)
"""

Choose a reason for hiding this comment

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

👍

pass

size = len(self.store)
while True:

Choose a reason for hiding this comment

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

Personally I don't like using infinite loops like this. It makes the flow of the loop harder to track. Overall this loop is also a bit overcomplicated.

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