55.二叉树最小深度

class Solution {
    public int minDepth(TreeNode root) {
        if(root==null){
            return 0;
        }
        int de=0;
        Queue<TreeNode> qu=new LinkedList<>();
        TreeNode tn;
        int le;
        qu.offer(root);
        while(!qu.isEmpty()){
            le=qu.size();
            while(le>0){
                tn=qu.poll();
                if(tn.left!=null){
                    qu.offer(tn.left);
                }
                if(tn.right!=null){
                    qu.offer(tn.right);
                }
                if(tn.left==null&&tn.right==null){
                    return de+1;
                }
                le--;
            }
            de++;
        }
        return de;
    }
}

class Solution(object):
    def minDepth(self, root):
        if root is None:
            return 0
        de=0
        qu=collections.deque()
        qu.append(root)
        while qu:
            le=len(qu)
            while le>0:
                tn=qu.popleft()
                if tn.left:
                    qu.append(tn.left)
                if tn.right:
                    qu.append(tn.right)
                if not tn.left and not tn.right:
                    return de+1
                le-=1
            de+=1
        return de