【Minimum Depth of Binary Tree】

正在沿着IT树往上爬

已于 2022-04-19 10:38:23 修改

阅读量233

点赞数

分类专栏： LeetCode 文章标签： java 开发语言 leetcode

于 2022-04-18 17:43:39 首次发布

本文链接：https://blog.csdn.net/weixin_39400958/article/details/124255202

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

这篇博客介绍了如何在Java中找到二叉树的最小深度。提供了两种方法，一种是递归实现，另一种是非递归实现。递归方案通过比较左右子树的最小深度来确定；非递归方案使用广度优先搜索策略，逐层遍历直到找到第一个叶子节点。这两种方法都在O(n)的时间复杂度内完成，其中n是树的节点数。

摘要由CSDN通过智能技术生成

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 1:

在这里插入图片描述

Input: root = [3,9,20,null,null,15,7]
Output: 2

Example 2:

Input: root = [2,null,3,null,4,null,5,null,6]
Output: 5

Constraints:

The number of nodes in the tree is in the range [0, 105].
-1000 <= Node.val <= 1000

Java Completion:

/**
 * 递归实现
 */
class Solution {
    public int minDepth(TreeNode root) {
        if (root == null) return 0;
        int depth = 0;
        int left = minDepth(root.left);
        int right = minDepth(root.right);
        if (left != 0 && right != 0) depth = Math.min(left, right);
        if (left == 0 || right == 0) depth = Math.max(left, right);
        return depth + 1;
    }
}

/**
 * 非递归实现
 */
class Solution {
    public int minDepth(TreeNode root) {
        if (root == null) return 0;
        Queue<TreeNode> stack = new LinkedList<>();
        stack.offer(root);
        int depth = 0;
        TreeNode rightMost = root;
        while (!stack.isEmpty()) {
            TreeNode poll = stack.poll();
            if (poll.left == null && poll.right == null) break;
            if (poll.left != null) stack.offer(poll.left);
            if (poll.right != null) stack.offer(poll.right);
            if (poll == rightMost) {
                depth++;
                rightMost = poll.right == null ? poll.left : poll.right;
            }
        }
        return depth;
    }
 }