leetcode_question_111 Minimum Depth of Binary Tree

最新推荐文章于 2024-10-01 05:04:32 发布

「已注销」

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量1.3k

点赞数

分类专栏： Leetcode 算法与数据结构程序员笔试面试文章标签： leetcode Minimum Depth of Bin

本文链接：https://blog.csdn.net/doc_sgl/article/details/11854399

版权

算法与数据结构同时被 3 个专栏收录

223 篇文章 1 订阅

订阅专栏

程序员笔试面试

223 篇文章 1 订阅

订阅专栏

Leetcode

179 篇文章 0 订阅

订阅专栏

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.

int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(root == NULL) return 0;
        queue<TreeNode*> que;
        que.push(root);
        int count = 1;
        int depth = 0;
        while(!que.empty())
        {
            TreeNode* tmp = que.front();
            que.pop();
            count--;
            
            if(tmp->left == NULL && tmp->right == NULL) break;
            
            if(tmp->left)
                que.push(tmp->left);
            if(tmp->right)
                que.push(tmp->right);
            
            if(count == 0){
                depth++;
                count = que.size();
            }
        }
        return ++depth;
    }