LeetCode 111. Minimum Depth of Binary

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

原创最新推荐文章于 2023-12-15 03:22:29 发布 · 168 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 3 个专栏收录

26 篇文章

订阅专栏

算法类

25 篇文章

订阅专栏

算法

13 篇文章

订阅专栏

本文介绍了一种求解二叉树最小深度的有效算法。通过递归方式遍历树的左右子节点，寻找从根节点到最近叶子节点的最短路径。文章提供了完整的C++实现代码，并针对特殊情况进行了优化。

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:

Given binary tree [3,9,20,null,null,15,7],

return its minimum depth = 2.

代码：

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == NULL)
            return 0;
        if(root->left == NULL || root->right == NULL)      //这种方法比较快
            return max(minDepth(root->left), minDepth(root->right))+1;
        return min(minDepth(root->left), minDepth(root->right))+1;
    }
};