-
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
tree fun #16
base: master
Are you sure you want to change the base?
tree fun #16
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, you hit the main learning goals. Take a look at my comments and let me know what questions you have.
# Time Complexity: O(1) | ||
# Space Complexity: O(1) | ||
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 O(log n) if the tree is balanced and O(n) if they are unbalanced.
# Time Complexity: O(n) | ||
# Space Complexity: O(1) | ||
def find(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.
👍 Similar issues to add
with time/space complexities.
# 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.
👍
def postorder_helper(node, list) | ||
if node.nil? | ||
return list | ||
end | ||
|
||
list << {key: node.key, value: node.value} | ||
postorder_helper(node.left, list) | ||
postorder_helper(node.right, 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.
This looks like a pre-order method.
def postorder_helper(node, list) | |
if node.nil? | |
return list | |
end | |
list << {key: node.key, value: node.value} | |
postorder_helper(node.left, list) | |
postorder_helper(node.right, list) | |
def postorder_helper(node, list) | |
if node.nil? | |
return list | |
end | |
postorder_helper(node.left, list) | |
postorder_helper(node.right, list) | |
list << {key: node.key, value: node.value} | |
# 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.
👍 , the time & space complexities are O(n) for unbalanced trees and O(log n) when the trees are balanced.
No description provided.