leetcode: Minimum Depth of Binary Tree

最新推荐文章于 2020-02-19 02:21:51 发布

martin_liang

最新推荐文章于 2020-02-19 02:21:51 发布

阅读量547

点赞数

CC 4.0 BY-SA版权

分类专栏： C++/C leetcode 算法

本文链接：https://blog.youkuaiyun.com/martin_liang/article/details/8896920

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一种求解二叉树最小深度的算法实现，通过递归方式遍历二叉树并找到从根节点到最近叶子节点的最短路径长度。文章提供了详细的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

» Solve this problem

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    void minDepthInternal(TreeNode *root, std::vector<TreeNode *> &treeVector, int &minDepth)
    {
        if (!root)
            return;
            
        treeVector.push_back(root);
        
        if (root->left == NULL && root->right == NULL)
        {
            if (treeVector.size() < minDepth)
            {
                minDepth = treeVector.size();
            }
            treeVector.pop_back();
            return;
        }
        
        minDepthInternal(root->left, treeVector, minDepth);
        minDepthInternal(root->right, treeVector, minDepth);
        
        treeVector.pop_back();
        
    }

    int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        if (!root)
            return 0;
            
        vector<TreeNode *> treeVector;
        int minDepth = 10000;
        
        minDepthInternal(root, treeVector, minDepth);
        
        return minDepth;
    }
};