Status: IN
`minDepth` uses BFS (level-order traversal) rather than DFS so it can return immediately at the first leaf encountered, avoiding full-tree traversal on unbalanced trees.
Source: entries/2026/06/06/minimum-depth-of-binary-tree-solution.md
JSON