Status: IN
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.
Source: entries/2026/06/06/minimum-depth-of-binary-tree-solution.md