LeetCode OJ 之 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.

最小深度是指从根结点到叶结点的最短路径的结点数目。

代码：

/**
 * 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;
             
        if (root->left == NULL && root->right == NULL)
             return 1;
             
         int leftDepth = minDepth(root->left);
         int rightDepth = minDepth(root->right);
         
         if (leftDepth == 0)//左子树为空，右子树不为空（如果右子树也为空，则上面已经返回1了），则右子树深度+1
             return rightDepth + 1;
         else if (rightDepth == 0)//右子树为空，左子树不为空，则左子树深度+1
             return leftDepth + 1;
         else
             return min(leftDepth, rightDepth) + 1;//左右都不为空
     }
    
};