[LeetCode] Minimum Depth of Binary Tree

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

boegkpmlkvebevwa

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

阅读量444

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/u014425050/article/details/24264531

LeetCode 同时被 3 个专栏收录

70 篇文章

订阅专栏

Algorithms

29 篇文章

订阅专栏

Binary Tree

19 篇文章

订阅专栏

本文介绍了一种求解二叉树最小深度的有效算法。通过递归方式遍历树的左右子节点，寻找从根节点到最近叶节点的最短路径长度。此算法适用于计算机科学与数据结构学习。

Total Accepted: 11612 Total Submissions: 39946

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;
        if (root.left == null && root.right == null) return 1;
        
        int depthL = Integer.MAX_VALUE; 
        int depthR = Integer.MAX_VALUE;
        
        if (root.left   != null) depthL = minDepth(root.left);
        if (root.right  != null) depthR = minDepth(root.right);
         
        return 1 + (depthL < depthR ? depthL : depthR);
    }
}