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 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==NULL)
return 0;
if(root->left==NULL && root->right==NULL)//只有一个根节点
return 1;
if(root->left!=NULL && root->right==NULL)//只有左儿子节点
return minDepth(root->left)+1;
if(root->left==NULL && root->right!=NULL)//只有右儿子节点
return minDepth(root->right)+1;
return min(minDepth(root->left),minDepth(root->right))+1;//左右均有,递归比较
}
};