111. 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.

计算一棵二叉树的最小深度，也就是根节点到叶节点的最小长度。使用递归的方法，要注意叶节点是左右节点都为空。

代码：

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->right), minDepth(root->left)) + 1;
	}
};