LeetCode - 111. Minimum Depth of Binary Tree

最新推荐文章于 2023-05-05 15:23:35 发布

热爱满天星

最新推荐文章于 2023-05-05 15:23:35 发布

阅读量166

点赞数

分类专栏： LeetCode 文章标签： Minimum Depth Binary Tree

本文链接：https://blog.csdn.net/SMonkeyKing/article/details/82377542

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Description

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.
Note: A leaf is a node with no children.

Example

Given binary tree [3,9,20,null,null,15,7],

3
/ \
9 20
/ \
15 7
return its minimum depth = 2.

Code

class Solution {
    public int minDepth(TreeNode root) {
        if(root == null) {
            return 0;
        }
        int leftDepth = minDepth(root.left);
        int rightDepth = minDepth(root.right);
        //有个样例是1，2，输出最小高度为2。
        //对于左右子树高度为0的要进行判断。root到最近的叶子节点的高度
        if(leftDepth == 0) {
            return rightDepth+1;
        }
        if(rightDepth == 0) {
            return leftDepth+1;
        }
        return Math.min(leftDepth,rightDepth)+1;
    }
}