-
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
Space - Antonia #32
base: master
Are you sure you want to change the base?
Space - Antonia #32
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.
Overall well done you hit the requirements. Check out my comments regarding the time & space complexities.
# Time Complexity: O(log n) | ||
# Space Complexity: O(1) | ||
def add_recursive(node, 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.
👍 , However the space complexity is O(log n) if the tree is balanced because of the call stack.
# Time Complexity: O(log n) | ||
# Space Complexity: O(1) | ||
def find_recursive(node, key) |
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.
👍 , However the space complexity is O(log n) if the tree is balanced because of the call stack.
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def inorder_recursive(node, list) |
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_recursive(node, list) |
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_recursive(node, list) |
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_recursive(node) |
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 space complexity is O(log n) if the tree is balanced and O(n) if it's unbalanced.
No description provided.