Leetcode 111. Minimum Depth of Binary Tree

Find the minimum number of nodes from the root to the nearest leaf in a binary tree (a leaf has no children), noting that nodes with only one child are not leaves. In other words, compute the length of the shortest root-to-leaf path—commonly solved by BFS to discover the nearest leaf early.