Minimum Depth of Binary Tree

ningbupt

于 2013-10-16 09:38:35 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode刷题

本文链接：https://blog.youkuaiyun.com/ningbupt/article/details/12773197

leetcode刷题专栏收录该内容

5 篇文章

订阅专栏

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

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

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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
           if(root==null){
	    	   return 0;
	       }
	       else if(root.left==null&&root.right==null){
	           return 1;
	       }
	       else if(root.left==null&&root.right!=null){
	           return 1+minDepth(root.right);
	       }
	       else if(root.left!=null&&root.right==null){
	           return 1+minDepth(root.left);
	       }
	       else {
	           return minDepth(root.left)>minDepth(root.right)?1+minDepth(root.right):1+minDepth(root.left);
	       }
    }
    
    
}