【Leetcode-easy-111】Minimum Depth of Binary Tree

最新推荐文章于 2025-07-29 14:24:32 发布

LYZ0907

最新推荐文章于 2025-07-29 14:24:32 发布

阅读量844

点赞数 1

CC 4.0 BY-SA版权

分类专栏： Leetcode LeetCode

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78236212

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

本文介绍了一种求解二叉树最小深度的有效算法。通过层次遍历的方式找到从根节点到最近叶子节点的最短路径长度。适用于LeetCode易题111，提供了简洁的Java实现。

【Leetcode-easy-111】Minimum Depth of Binary Tree

题目

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 minDepth(TreeNode root) {
        if (root == null) return 0;
        // if (root.left == null || root.right == null) return 1;

        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int level = 0;
        while (!queue.isEmpty()){
            level ++;
            int len = queue.size();
            for (int i = 0; i < len; i ++){
                TreeNode currNode = queue.poll();
                if (currNode.left == null && currNode.right == null)
                    return level;
                if (currNode.left != null) queue.offer(currNode.left);
                if (currNode.right != null) queue.offer(currNode.right);
            }
        }
        return level;
    }
}