0111：二叉树的最小深度

1
2
3
4
5
6
7
8
9

class Solution:
    def minDepth(self, root: Optional[TreeNode]) -> int:
        res,Q = 0,[root] if root else []
        while Q:
            res += 1
            if any(not u.left and not u.right for u in Q):
                break
            Q = [c for u in Q for c in [u.left,u.right] if c]
        return res