Status: IN
`maxDepth` uses no auxiliary data structures; space complexity is O(h) from the call stack alone, where h is tree height.
Source: entries/2026/06/06/maximum-depth-of-binary-tree-solution.md
JSON