public class Solution {
public int minDepth(TreeNode root) {
if (root == null) return 0;
// take care of the trees that only have left or right child
if (root.left == null) return minDepth(root.right) + 1;
if (root.right == null) return minDepth(root.left) + 1;
return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
}
}
Leetcode 111. Minimum Depth of Binary Tree
最新推荐文章于 2023-11-10 00:09:39 发布