Skip to content

Conversation

@laneia
Copy link

@laneia laneia commented Sep 24, 2019

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.

Thank you for getting this in. Excellent work. Take a look at my comments and let me know if you have any questions.

# Time Complexity:
# Space Complexity:
# Time Complexity: O(log n) if balanced tree, O(n) if unbalanced, n = # nodes in tree
# Space Complexity: O(log n) if balanced tree, O(n) if unbalanced, n = # nodes in tree

Choose a reason for hiding this comment

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

Yes since you're doing recursion

raise NotImplementedError
end
# Time Complexity: O(n), n = # nodes in tree
# Space Complexity: O(1)

Choose a reason for hiding this comment

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

Since this is recursive, you have the system stack being used here and the space complexity is O(Log n)

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