Skip to content

Conversation

@mulhoo
Copy link

@mulhoo mulhoo commented Sep 1, 2020

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.

Liv, nice work you hit all the learning goals here. Well done.

Comment on lines +19 to 21
# Time Complexity: o(logn)
# Space Complexity: o(logn)
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 space and time complexities are correct assuming the tree is balanced.

Comment on lines +25 to 27
# Time Complexity: o(logn)
# Space Complexity: o(logn)
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 +38 to 40
# Time Complexity: on
# Space Complexity: on
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 +44 to 46
# Time Complexity: on
# Space Complexity: on
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 +50 to 52
# Time Complexity: on
# Space Complexity: on
def postorder

Choose a reason for hiding this comment

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

👍

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