树 Minimum Depth of Binary Tree

方法一：递归

root为空，返回0；

只有root节点，返回1；

root左子树为空，返回右子树深度+1；

root右子树为空，返回左子树深度+1；

否则，返回左子树和右子树的最小者再+1；

/**
 * Definition for binary tree
 * 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 == NULL && root->right == NULL) return 1;
        
        int left = minDepth(root->left);
        int right = minDepth(root->right);
        if(left == 0)
            return right + 1;
        else if(right == 0)
            return left + 1;
        else
            return min(left,right)+1;
    }
};

方法二：迭代，BFS

每到一个叶子节点就比较该叶子的深度与目前知道的最小深度，取最小值。直到最后都遍历完。

/**
 * Definition for binary tree
 * 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 == NULL) return 0;
        int result = INT_MAX;
        stack<pair<TreeNode*,int>> s;
        s.push(make_pair(root, 1));
        
        while(!s.empty()) {
            auto node = s.top().first;
            auto depth = s.top().second;
            s.pop();
            if(node->left == NULL && node->right == NULL)
                result = min(result,depth);
            if(node->left && result > depth) {
                s.push(make_pair(node->left, depth + 1));
            }
            if(node->right && result > depth) {
                s.push(make_pair(node->right, depth + 1));
            }
        }
        return result;
    }
};