Skip to content

Conversation

@TaylorMililani
Copy link

I added values in 2 of the tests for height, I was getting an error that the add method was only getting 1 arg when it needed 2. Let me know if this doesn't work!

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.

Nice work Taylor, you hit the learning goals here. Well done.

Comment on lines +22 to 24
# Time Complexity: O(n)
# 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.

👍

Comment on lines +48 to 50
# Time Complexity: worst case: O(n), best case: O(log 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.

👍

Comment on lines +64 to +66
# Time Complexity: O(n)
# Space Complexity: O(n)
def inorder(array=[], current=@root)

Choose a reason for hiding this comment

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

👍

Comment on lines +73 to +75
# Time Complexity: O(n)
# Space Complexity: O(n)
def preorder(array=[],current=@root)

Choose a reason for hiding this comment

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

👍

Comment on lines +82 to +84
# Time Complexity: O(n)
# Space Complexity: O(n)
def postorder(array=[], current=@root)

Choose a reason for hiding this comment

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

👍

Comment on lines +91 to +93
# Time Complexity: O(n)
# Space Complexity: O(n)
def height(current=@root)

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 isn't.

Comment on lines +105 to 107
# Time Complexity: O(n)
# Space Complexity: O(n)
def bfs

Choose a reason for hiding this comment

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

👍

Comment on lines +105 to +106
my_tree.add(100, "bella")
my_tree.add(110, "rocky")

Choose a reason for hiding this comment

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

This works, but you can also make the value an optional parameter.

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