Branches - Diana Han #38
Open
Conversation
This file contains 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
Feb 27, 2020
There was a problem hiding this comment.
Really nice work, you hit most of the learning goals here. Very elegantly written code. The only issue is with find, as it's not quite working, and you have some issues with space complexity, remember recursion incurs space complexity. Check out my comments and let me know any questions you have.
Comment on lines
+57
to
59
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def add(key, value) |
There was a problem hiding this comment.
This method is recursive so it's going to have some space complexity. What do you think it is?
Comment on lines
+70
to
+76
| until current.key == key | ||
| if current.key > key | ||
| current = current.left | ||
| else | ||
| current = current.right | ||
| end | ||
| end |
There was a problem hiding this comment.
What about if the key is not in the tree? What about when current is nil?
Suggested change
| until current.key == key | |
| if current.key > key | |
| current = current.left | |
| else | |
| current = current.right | |
| end | |
| end | |
| until current.key == key | |
| if current.key > key | |
| current = current.left | |
| else | |
| current = current.right | |
| end | |
| return nil if current.nil? | |
| end |
Comment on lines
+89
to
91
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) n represents the number of nodes in a tree | ||
| def inorder |
Comment on lines
+104
to
106
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def preorder |
Comment on lines
+119
to
121
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def postorder |
Comment on lines
+138
to
140
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def height |
There was a problem hiding this comment.
Note that this is a recursive method so you're going to have space complexity due to the call stack.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
No description provided.