{"id":"mindepth-single-child-not-leaf","text":"A node with exactly one child is never treated as a leaf in `minDepth`; the algorithm descends into the existing subtree — the key correctness property that distinguishes minimum depth from maximum depth.","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-single-child-not-leaf","truth_value":"IN","reason":"premise"}]}}