Skip to content
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

Open
birdyhuang opened this issue Feb 28, 2016 · 5 comments
Open

4.8 Java #146

birdyhuang opened this issue Feb 28, 2016 · 5 comments

Comments

@birdyhuang
Copy link

The question said both trees are very large. Does it mean we should not use a recursive way of doing this?

@piyush121
Copy link

Complexity will remain same in case of recursion.

@birdyhuang
Copy link
Author

But recursion may get stack overflow, doesn't it?

@piyush121
Copy link

Yeah it will. But I think we have to assume that our system can handle O(n) space.

@futuremojo
Copy link
Collaborator

For what it's worth, I didn't use recursion for my solution precisely because it mentioned the trees are large.

@birdyhuang
Copy link
Author

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
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants