Difficulty: Easy
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 {
int helper(TreeNode *root){
if(!root->left&&!root->right)
return 1;
int left=INT_MAX;
if(root->left)
left=helper(root->left);
int right=INT_MAX;
if(root->right)
right=helper(root->right);
return min(left,right)+1;
}
public:
int minDepth(TreeNode* root) {
if(!root)
return 0;
return helper(root);
}
};