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.
Solution:Code:
<span style="font-size:14px;">/**
* 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;
if (!root->left && !root->right) return 1;
int left = minDepth(root->left);
int right = minDepth(root->right);
int minD;
if (left == 0) minD = right+1;
else if (right == 0) minD = left+1;
else minD = min(left, right)+1;
return minD;
}
};</span>