-
Notifications
You must be signed in to change notification settings - Fork 2.3k
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
4.8 Java #146
Comments
Complexity will remain same in case of recursion. |
But recursion may get stack overflow, doesn't it? |
Yeah it will. But I think we have to assume that our system can handle O(n) space. |
For what it's worth, I didn't use recursion for my solution precisely because it mentioned the trees are large. |
Then why does the question mention the size of the tree? Is it just useless or some kinda clue? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The question said both trees are very large. Does it mean we should not use a recursive way of doing this?
The text was updated successfully, but these errors were encountered: