919. 完全二叉树插入器

最新推荐文章于 2024-05-21 23:16:53 发布

anieoo

最新推荐文章于 2024-05-21 23:16:53 发布

阅读量148

点赞数

分类专栏： Leetcode # 每日一题文章标签：算法数据结构

本文链接：https://blog.csdn.net/qq_42174306/article/details/125971918

版权

Leetcode 同时被 2 个专栏收录

400 篇文章 1 订阅

订阅专栏

每日一题

122 篇文章 0 订阅

订阅专栏

原题链接：919. 完全二叉树插入器

solution:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class CBTInserter {
public:
    TreeNode *R;
    vector<TreeNode *> h;
    CBTInserter(TreeNode* root) {   //建立完全二叉树
        h.resize(1);
        R = root;
        queue<TreeNode*> q;
        q.push(root);
        while (q.size()) {
            auto t = q.front();
            q.pop();
            h.push_back(t);
            if (t->left) q.push(t->left);
            if (t->right) q.push(t->right);
        }
    }   
    int insert(int val) {
        auto t = new TreeNode(val);
        h.push_back(t);
        int k = h.size() - 1;   //结点在堆中的位置
        int p = k / 2;
        if(k == 2 * p) h[p]->left = t;
        else h[p]->right = t;
        return h[p]->val;
    }
    
    TreeNode* get_root() {
        return R;
    }
};

/**
 * Your CBTInserter object will be instantiated and called as such:
 * CBTInserter* obj = new CBTInserter(root);
 * int param_1 = obj->insert(val);
 * TreeNode* param_2 = obj->get_root();
 */