leetcode 日经贴，Cpp code -Minimum Depth of Binary Tree

/**
* 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 a = INT_MAX, b = INT_MAX;
if (root->left) {
a = minDepth(root->left) + 1;
}
if (root->right) {
b = minDepth(root->right) + 1;
}
return min(a, b);
}
};