https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/
逻辑是当没有左右孩子节点的时候,+1深度,递归的思想。
/**
* 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;
else if(root.left == null && root.right == null) return 1;
else if(root.left != null && root.right == null){
int res = 1 + minDepth(root.left);
return res;
}
else if(root.left == null && root.right != null){
int res = 1 + minDepth(root.right);
return res;
}
int left = 1 + minDepth(root.left);
int right = 1 + minDepth(root.right);
int res = left < right ? left : right;
return res;
}
}