Skip to content

Conversation

@Beatress
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 Beatrice, you hit the learning goals here. Nice work. I had a few comments on time/space complexities, but otherwise very well done. Let me know if you have any questions.

Comment on lines +19 to 21
# Time Complexity: O(log n)
# Space Complexity: O(n) - call stack
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 both O(log n) if the tree is balanced and O(n) if unbalanced.

Comment on lines +42 to +44
# Time Complexity: O(log n)
# Space Complexity: O(n) - call stack
def find(key, current = @root)

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 both O(log n) if the tree is balanced and O(n) if unbalanced.

Comment on lines +55 to +57
# Time Complexity: O(n)
# Space Complexity: O(n)
def inorder(current = @root, answer = [])

Choose a reason for hiding this comment

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

👍

Comment on lines +68 to +70
# Time Complexity: O(n)
# Space Complexity: O(n)
def preorder(current = @root, answer = [])

Choose a reason for hiding this comment

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

👍

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

Choose a reason for hiding this comment

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

👍

Comment on lines +92 to +94
# 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 time complexity here is right, but the space complexity is O(log n) if the tree is balanced and O(n) if it's not.

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