-
Notifications
You must be signed in to change notification settings - Fork 44
India - Water #32
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
base: master
Are you sure you want to change the base?
India - Water #32
Conversation
CheezItMan
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work India, you hit the learning goals here. I left a few comments on space/time complexity, but otherwise this is all correct.
| # Time Complexity: O(logn) | ||
| # Space Complexity: O(logn) | ||
| def add(key, value = nil) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 the method is Log n if the tree is roughly balanced.
| # Time Complexity: O(logn) | ||
| # Space Complexity: O(logn) | ||
|
|
||
| def find(key, current = @root) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 the method is Log n if the tree is roughly balanced.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def inorder |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def preorder |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def postorder |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
| # Time Complexity: O(n) | ||
| # Space Complexity: O(n) | ||
| def height |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Because the recursion depth is dependent on the height of the tree it's O(log n) for space complexity for a balanced tree. It's O(n) if the tree isn't balanced.
No description provided.