Leetcode-Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Easy, DFS搞定

    public int minDepth(TreeNode root) {
        if(root == null)
        {
            return  0;
        }
        if(root.left == null &&  root.right == null){
            return  1;
        }
        int leftDepth=0;
        int rightDepth = 0;
        if(root.left !=null){
            leftDepth = 1 + minDepth(root.left);
        }
        if(root.right !=null){
            rightDepth = 1+ minDepth(root.right);
        }
        
        if(leftDepth > 0){
            if(rightDepth > 0)
            {    return leftDepth<rightDepth ? leftDepth:rightDepth;}
            else
            {     return leftDepth;}
        }else{
            return rightDepth;
        }
    }