LC111 二叉树的最小深度

题目描述：

代码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
//DFS深度优先搜索
class Solution {
    public int minDepth(TreeNode root) {
if(root==null){
    return 0;
}
int left=minDepth(root.left);//求出左边子树深度
int right=minDepth(root.right);//求出右边子树深度
if(left==0){//左子树为空
    return right+1;
}
if(right==0){右子树为空
    return left+1;
}
return Math.min(left,right)+1;//左右子树都不为空
    }
}