/**
* 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 minDepth(root->left) + 1;
if (root->right != NULL && root->left == NULL) return minDepth(root->right) + 1;
int levl = minDepth(root->left);
int revl = minDepth(root->right);
return min(revl, levl) + 1;
}
};