class Solution {
public:
int minDepth(TreeNode* root) {
if (!root) return 0;
if (!root->left && !root->right) return 1;
if (!root->right)
return minDepth(root->left)+1;
if (!root->left) {
return minDepth(root->right)+1;
}
return min(minDepth(root->left),
minDepth(root->right)) + 1;
}
};
leetcode min depth of binary tree
最新推荐文章于 2019-11-14 17:43:32 发布