非递归解决leetcode Minimum Depth of Binary Tree

基础题

/**
 * 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) {
        int mindepth = 0;
        if(root == NULL) return mindepth;
        
        queue<TreeNode*> tree;
        tree.push(root);
        int num;
        while(!tree.empty())
        {
            num = tree.size();
            ++mindepth;
            
            for(int i=0;i<num;++i)
            {
                if((tree.front())->left == NULL && (tree.front())->right == NULL)
                    return mindepth;
                else{
                    if(tree.front()->left != NULL) tree.push(tree.front()->left);
                    if(tree.front()->right != NULL) tree.push(tree.front()->right);
                }
                tree.pop();
            }
        }
    }
};