LeetCode_Archiver/LeetCode/cpp/919.cpp at master · chr1sc2y/LeetCode_Archiver · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class CBTInserter {
    vector<TreeNode *> nodeVector;
public:
    CBTInserter(TreeNode *root) {
        nodeVector.clear();
        if (root) nodeVector.push_back(root);
        int i = 0;
        while (true) {
            if (nodeVector[i]->left)
                nodeVector.push_back(nodeVector[i]->left);
            else
                break;
            if (nodeVector[i]->right)
                nodeVector.push_back(nodeVector[i]->right);
            else
                break;
            ++i;
        }
    }

    int insert(int v) {
        auto &&size = nodeVector.size(), &&parent = (size - 1) / 2;
        TreeNode *child = new TreeNode(v);
        if (size % 2 == 0)
            nodeVector[parent]->right = child;
        else
            nodeVector[parent]->left = child;
        nodeVector.push_back(child);
        return nodeVector[parent]->val;
    }

    TreeNode *get_root() {
        return nodeVector.front();
    }
};