科目一刷题06 二叉树层次遍历

最新推荐文章于 2024-08-16 23:08:28 发布

zhranjie

最新推荐文章于 2024-08-16 23:08:28 发布

阅读量360

点赞数 2

分类专栏：刷题日记文章标签： java linux 数据结构

本文链接：https://blog.csdn.net/zhranjie/article/details/140226399

版权

刷题日记专栏收录该内容

6 篇文章 0 订阅

订阅专栏

102. 二叉树的层序遍历 - 力扣（LeetCode）

vector<vector<int>> levelOrder(TreeNode* root)
{
    vector<vector<int>> ret;
    vector<int> oneLayer;
    if (root == nullptr) {
        return ret;
    }
    queue<TreeNode*> q;
    q.emplace(root);
    int len = 1;
    int cur = 0;
    int s = 0;
    while (!q.empty()) {
        oneLayer.clear();
        s = 0;
        while (cur < len) {
            TreeNode* tmp = q.front();
            oneLayer.push_back(tmp->val);
            q.pop();
            if (tmp->left != nullptr) {
                q.push(tmp->left);
                s++;
            }
            if (tmp->right != nullptr) {
                q.push(tmp->right);
                s++;
            }
            cur++;
        }
        ret.push_back(oneLayer);
        len = s;
        cur = 0;
    }
    return ret;
}

107. 二叉树的层序遍历 II - 力扣（LeetCode）

vector<vector<int>> levelOrder(TreeNode* root)
{
    vector<vector<int>> ret;
    vector<int> oneLayer;
    if (root == nullptr) {
        return ret;
    }
    queue<TreeNode*> q;
    q.emplace(root);
    int len = 1;
    int cur = 0;
    int s = 0;
    while (!q.empty()) {
        oneLayer.clear();
        s = 0;
        while (cur < len) {
            TreeNode* tmp = q.front();
            oneLayer.push_back(tmp->val);
            q.pop();
            if (tmp->left != nullptr) {
                q.push(tmp->left);
                s++;
            }
            if (tmp->right != nullptr) {
                q.push(tmp->right);
                s++;
            }
            cur++;
        }
        ret.push_back(oneLayer);
        len = s;
        cur = 0;
    }
    std::reverse(ret.begin(), ret.end());
    return ret;
}

637. 二叉树的层平均值 - 力扣（LeetCode）

vector<double> averageOfLevels(TreeNode* root)
{
    vector<double> ret;
    queue<TreeNode*> q;
    if (root == nullptr) {
        return ret;
    }
    int cur = 0;
    int curLayerSize = 1;
    int nextLayerSize = 0;
    while (!q.empty()) {
        double sum = 0.0;
        while (cur < curLayerSize) {
            TreeNode* node = q.front();
            q.pop();
            sum += node->val;
            if (node->left != nullptr) {
                q.push(node->left);
                nextLayerSize++;
            }
            if (node->right != nullptr) {
                q.push(node->right);
                nextLayerSize++;
            }
            cur++;
            if (cur == curLayerSize) {
                ret.push_back(sum / curLayerSize);
            }
        }
        curLayerSize = nextLayerSize;
        nextLayerSize = 0;
        cur = 0;
    }
    return ret;
}

199. 二叉树的右视图 - 力扣（LeetCode）

vector<int> rightSideView(TreeNode* root)
{
    vector<int> ret;
    if (root == nullptr) {
        return ret;
    }
    queue<TreeNode*> q;
    q.emplace(root);
    int len = 1;
    int cur = 0;
    int s = 0;
    while (!q.empty()) {
        s = 0;
        while (cur < len) {
            TreeNode* tmp = q.front();
            q.pop();
            if (tmp->left != nullptr) {
                q.push(tmp->left);
                s++;
            }
            if (tmp->right != nullptr) {
                q.push(tmp->right);
                s++;
            }
            if (cur == len - 1) {
                ret.push_back(tmp->val);
            }
            cur++;
        }
        len = s;
        cur = 0;
    }
    return ret;
}