class Solution {
public:
int minDepth(TreeNode* root) {
int ans = 0,size = 1,i = 0;
TreeNode* p =root;
queue<TreeNode*> s;
if (root)ans++, s.push(root);
while (!s.empty()) {
p = s.front();
s.pop();
i++;
if (p->left == NULL && p->right == NULL)return ans;
if (p->left)s.push(p->left);
if (p->right)s.push(p->right);
if (i == size)
size = s.size(), i = 0, ans++;
}
return ans;
}
};
LeetCode 111. 二叉树的最小深度
最新推荐文章于 2024-07-13 13:36:16 发布