LeetCode：Minimum Depth of Binary Tree

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

原创最新推荐文章于 2020-02-19 02:21:51 发布 · 490 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

19 篇文章

订阅专栏

本文深入探讨了宽搜算法的应用及实现细节，通过实例演示如何利用该算法解决特定问题。

宽搜

class Solution {
public:
    int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
       if(root == NULL)
       return 0;
       int level = 1;
       vector<TreeNode*>tree;
       tree.push_back(root);
       int begin = 0;
       int end = 1;
       while(begin<end)
       {
           TreeNode* node = tree[begin];
           if(node->right==NULL&&node->left==NULL)
              return level;
           if(node->right)
              tree.push_back(node->right);
           if(node->left)
              tree.push_back(node->left);
           if(begin == end-1)
           {
               end = tree.size();
               level++;
           }
           begin++;
       }
    
    }
};