leetcode--Minimum Depth of Binary Tree

weixin_30907523

于 2019-08-20 23:28:37 发布

阅读量87

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/averillzheng/p/3537467.html

本文介绍了一种求解二叉树最小深度的算法实现，通过递归方式找到从根节点到最近叶子节点的最短路径长度。算法考虑了左子树和右子树的情况，选择更短的一边加一作为当前节点的最小深度。

摘要生成于 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.

public class Solution {
    public int minDepth(TreeNode root) {
       int depth = 0;
	   if(root != null){
	        if(root.left == null)
			    depth = 1 + minDepth(root.right);
			else if(root.right == null)
			    depth = 1 + minDepth(root.left);
			else
			    depth = 1 + Math.min(minDepth(root.left), minDepth(root.right));
	   } 
		return depth;
    }
}

转载于:https://www.cnblogs.com/averillzheng/p/3537467.html