class Solution {
public:
int minDepth(TreeNode* root) {
if(root == NULL) return 0;
int leftDep = minDepth(root->left);
int rightDep = minDepth(root->right);
if(leftDep == 0 && rightDep == 0) return 1;//叶子节点
if(leftDep == 0) leftDep = INT_MAX;
if(rightDep == 0) rightDep = INT_MAX;//中间节点
return min(leftDep, rightDep) + 1;
}
};
二叉树的最小深度
最新推荐文章于 2022-07-17 09:33:04 发布