-
Notifications
You must be signed in to change notification settings - Fork 44
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
Water - Beatrice #25
base: master
Are you sure you want to change the base?
Water - Beatrice #25
Conversation
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.
Well done Beatrice, you hit the learning goals here. Nice work. I had a few comments on time/space complexities, but otherwise very well done. Let me know if you have any questions.
# Time Complexity: O(log n) | ||
# Space Complexity: O(n) - call stack | ||
def add(key, value) |
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 time & space complexities are both O(log n) if the tree is balanced and O(n) if unbalanced.
# Time Complexity: O(log n) | ||
# Space Complexity: O(n) - call stack | ||
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 time & space complexities are both O(log n) if the tree is balanced and O(n) if unbalanced.
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def inorder(current = @root, answer = []) |
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(current = @root, answer = []) |
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(current = @root, answer = []) |
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(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 time complexity here is right, but the space complexity is O(log n) if the tree is balanced and O(n) if it's not.
No description provided.