Minimum Depth of Binary Tree

最新推荐文章于 2023-12-15 03:22:29 发布

havedream_one

最新推荐文章于 2023-12-15 03:22:29 发布

阅读量3.7k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/havedream_one/article/details/42557957

LeetCode 专栏收录该内容

85 篇文章

订阅专栏

本文介绍了一种求解二叉树最小深度的算法实现，该算法递归地计算从根节点到最近叶子节点的最短路径上的节点数。通过判断左右子节点是否存在来决定递归方向，并最终确定最小深度。

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;
        return depthOfTree(root);
    }
    public int depthOfTree(TreeNode root){
        if(root.left == null && root.right == null){//叶子节点
            return 1;
        }
        int left = 0;
        if(root.left != null)
            left = depthOfTree(root.left);
        int right = 0;
        if(root.right != null)
            right = depthOfTree(root.right);
        if(left != 0 && right != 0)
            return 1 + (left < right ? left : right);
        else if(left != 0)
            return 1 + left;
        else 
            return 1 + right;
    }
}

跟求树的最大深度的思想一样

Runtime: 257 ms