leetcode Minimum Depth of Binary Tree 1.11 难度系数1

yundomo

于 2014-01-25 12:07:46 发布

阅读量723

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/yiding_he/article/details/18766019

leetcode java 150 专栏收录该内容

86 篇文章

订阅专栏

本文介绍如何通过递归的方式找到二叉树中的最小深度，即从根节点到最近叶子节点的最短路径长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question:

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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int minDepth(TreeNode root) {
		
	
	 
        if(root==null) return 0;  
          
        int l = minDepth(root.left);  
        int r = minDepth(root.right);  
          
        if(l==0) return r+1;  
        if(r==0) return l+1;  
          
        return Math.min(l, r) + 1;  
          
    }  
}