Open
Conversation
kyra-patton
reviewed
Jun 2, 2022
kyra-patton
left a comment
kyra-patton
left a comment
There was a problem hiding this comment.
💫🤠 Very nice work Symone. I left some comments on space complexity below. Let me know what questions you have.
🟢
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(n log n) | ||
| Space Complexity: O(n) |
| self.store = [] | ||
|
|
||
| # helpers | ||
| def parent_index(self, index): |
| self.store[index_1] = self.store[index_2] | ||
| self.store[index_2] = temp | ||
|
|
||
| self.store[index_1], self.store[index_2] = self.store[index_2], self.store[index_1] |
| the heap property is reestablished. | ||
| """ | ||
| pass | ||
|
|
| Time complexity: ? | ||
| Space complexity: ? | ||
| Time complexity: O(log n) | ||
| Space complexity: O(1) |
There was a problem hiding this comment.
✨ However because of the recursive call stack, space complexity is O(log n)
| Time complexity: ? | ||
| Space complexity: ? | ||
| Time complexity: O(1) | ||
| Space complexity: O(1) |
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(log n) | ||
| Space Complexity: O(1) |
There was a problem hiding this comment.
✨ Because of the recursive call stack of heap_down space complexity is O(log n)
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(log n) | ||
| Space Complexity: O(1) |
There was a problem hiding this comment.
✨ Because of the recursive call stack of heap_up, space complexity is O(log n)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
How is a Heap different from a Binary Search Tree?
Could you build a heap with linked nodes?
Why is adding a node to a heap an
O(log n)operation?O(log n)operation (worst-case) because we need to swap a node at each level of the Binary Tree. A full Binary Tree hasO(log n)levels with n being the number of nodes.Were the
heap_up&heap_downmethods useful? Why?heap_upandheap_downmethods were useful because it increased my comprehension of how the swaps take place based on the value of the element.