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