class Solution {
public:
int minDepth(TreeNode* root) {
if(root==NULL)
{
return 0;
}
int left = minDepth(root->left);
int right = minDepth(root->right);
if(left == 0) return right + 1;
if(right == 0) return left + 1;
return min(right,left)+1;
}
};
树的最小深度
最新推荐文章于 2022-07-30 10:15:41 发布