Mariela Cruz - Scissors #35
Open
Conversation
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
CheezItMan
reviewed
Dec 3, 2021
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Nice work Mariela, you hit most of the learning goals. I spotted a few mistakes in postorder (mostly a typo). Otherwise great work.
Comment on lines
+31
to
+33
| # Time Complexity: O(log n) - balanced tree | ||
| # Space Complexity: O (log n) - recursive approach | ||
| def add(self, key, value = None): |
| # parent.right = TreeNode(key, value) | ||
| # Time Complexity: O(log n) | ||
| # Space Complexity: | ||
| def find(self, key): |
| else: | ||
| current = current.right | ||
|
|
||
| def inorder_helper(self, current, inorder_list): |
Comment on lines
+86
to
+87
| # helper function for pre order | ||
| def preorder_helper(self, current, traversal_list): |
Comment on lines
+106
to
+108
| self.preorder_helper(current.left, postorder_list) | ||
| self.preorder_helper(current.right, postorder_list) | ||
| postorder_list.append({"key": current.key,"value":current.value}) |
There was a problem hiding this comment.
Suggested change
| self.preorder_helper(current.left, postorder_list) | |
| self.preorder_helper(current.right, postorder_list) | |
| postorder_list.append({"key": current.key,"value":current.value}) | |
| postorder_list.append({"key": current.key,"value":current.value}) | |
| self.postorder_helper(current.left, postorder_list) | |
| self.postorder_helper(current.right, postorder_list) |
| self.postorder_helper(self.root, postorder_list) | ||
| return postorder_list | ||
|
|
||
| def height_helper(self, current): |
Comment on lines
+126
to
128
| # Time Complexity: O(logn) | ||
| # Space Complexity: O (1) | ||
| def height(self): |
There was a problem hiding this comment.
👍 Since the helper is recursive, we have O(log n) space complexity for a balanced tree.
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.
2 bfs fail, 1 fail post order fail