{"id":"mindepth-depth-one-indexed","text":"`minDepth` uses 1-indexed depth (root = 1), so a single-node tree returns 1 and an empty tree returns 0.","truth_value":"IN","source":"entries/2026/06/06/minimum-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":"mindepth-depth-one-indexed","truth_value":"IN","reason":"premise"}]}}