leetcode【111】Minimum Depth of Binary Tree【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],

    3
   / \
  9  20
    /  \
   15   7

return its minimum depth = 2.

源码：

递归大法，时间一般，空间100%。

/**
 * 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)   return 0;
        if(!root->left)     return minDepth(root->right)+1;
        if(!root->right)     return minDepth(root->left)+1;
        return min(minDepth(root->left), minDepth(root->right))+1;
    }
};

非递归，还是用队列模拟递归过程。时间96%，空间100%。

/**
 * 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)   return 0;
        queue<TreeNode*> st;
        st.push(root);
        int level = 0;
        while(!st.empty()){
            level++;
            for(int i=st.size(); i>0; i--){
                auto tmp = st.front();
                st.pop();
                if(!tmp->left && !tmp->right)    return level;
                if(tmp->left)   st.push(tmp->left);
                if(tmp->right)  st.push(tmp->right);
            }
        }
        return -1;
    }
};