Minimum Depth of Binary Tree:求二叉树深度最浅的一只分叉

最新推荐文章于 2023-12-27 08:00:00 发布

想改名的小雄鹿

最新推荐文章于 2023-12-27 08:00:00 发布

阅读量188

点赞数

分类专栏： Leetcode 文章标签： JAVA Leetcode 二叉树

本文链接：https://blog.csdn.net/u013300579/article/details/79090170

版权

Leetcode 专栏收录该内容

188 篇文章 1 订阅

订阅专栏

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 a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int dfs(TreeNode n, int depth){
        if(n == null) return Integer.MAX_VALUE - 10;
        if((n.left == null) &&(n.right==null)) return depth;
        int l = dfs(n.left,depth + 1);
        int r = dfs(n.right,depth+1);
        return Math.min(l,r);
        
    }
    
    public int minDepth(TreeNode root) {
        if(root == null) return 0;
        return dfs(root,1);
    }
}