111. 二叉树的最小深度
原题
/**
* 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;
* }
* }
*/
class Solution {
public int minDepth(TreeNode root) {
if(root==null){
return 0;
}
//情况1:左右孩子都为空
if(root.left==null&&root.right==null){
return 1;
}
int leftHeight = minDepth(root.left);
int rightHeight = minDepth(root.right);
//情况2:左孩子为空或右孩子为空,则返回不为空的深度,其中有一个深度必然为0
if(root.left==null||root.right==null){
return leftHeight+rightHeight+1;
}
//情况3:左右孩子都不为空,返回较小的
return Math.min(leftHeight,rightHeight)+1;
}
}