Minimum Depth of Binary Tree

题目：

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:

​ 3
/ \
9 20
/ \
15 7

return its minimum depth = 2

递归解法：

/**
 * 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 == nullptr)
            return 0;
        int left = minDepth(root->left);
        int right = minDepth(root->right);
        return (left == 0 || right == 0) ? left + right + 1: (min(left,right) + 1);
    }
};

非递归解法：

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == nullptr)
            return 0;
        queue<TreeNode*> que;
        que.push(root);
        int level = 1;
        while(!que.empty())
        {
            int size = que.size();
            while(size)
            {
                root = que.front();que.pop();
                if(root->left == nullptr && root->right == nullptr)
                    return level;
                if(root->left != nullptr)
                    que.push(root->left);
                if(root->right != nullptr)
                    que.push(root->right);
                --size;
            }
            ++level;
        }
        return level;
    }
};

此代码利用了树的层次遍历，如果遇到节点的左子树和右子树都为空时，返回。

下面这种解法不对：

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == nullptr)
            return 0;
        return (min(left,right) + 1);
    }
};

下面这种情况，此代码会判断最小深度为1，为实际最小深度为2，题目给的定义：最小深度是沿从根节点到最近的叶节点的最短路径上的节点数。而下面这种情况1不是叶子节点，所以最小深度为2.

注意：叶子是没有子节点的节点。

1

/

2