Skip to content

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

@snapfinger

Description

@snapfinger

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions