{"id":"maxdepth-is-pure-recursive","text":"`maxDepth` uses no auxiliary data structures; space complexity is O(h) from the call stack alone, where h is tree height.","truth_value":"IN","source":"entries/2026/06/06/maximum-depth-of-binary-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"maxdepth-is-pure-recursive","truth_value":"IN","reason":"premise"}]}}