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.

Sign up for GitHub

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

Jump to bottom

Space complexity of solution to Maximum Depth Of Binary Tree #301

Open

snapfinger opened this issue Jul 5, 2020 · 1 comment

snapfinger commented Jul 5, 2020

The space complexity was specified as O(1) in the solution, however because of recursion, considering the stack, should it be O(n) instead?

KartikSatoskar commented Oct 21, 2020

@snapfinger Yes you are correct. Space complexity of the solution should be O(n).
@soapyigu Should I raise the PR to fix this?

KartikSatoskar mentioned this issue

Closed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment