Skip to content
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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

tree fun #16

wants to merge 1 commit into from

Conversation

katemyer
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a 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.

Comment on lines +35 to 37
# Time Complexity: O(1)
# Space Complexity: O(1)
def add(key, value)

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.

Comment on lines +59 to 61
# Time Complexity: O(n)
# Space Complexity: O(1)
def find(key)

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.

Comment on lines +78 to 80
# Time Complexity: O(n)
# Space Complexity: O(n)
def inorder

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +100 to 102
# Time Complexity: O(n)
# Space Complexity: O(n)
def preorder

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +110 to +118
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)

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.

Suggested change
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}

Comment on lines +145 to 147
# Time Complexity: O(n)
# Space Complexity: O(n)
def height

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants