Leetcode-919 Complete Binary Tree Inserter(完全二叉树插入器)

vector<TreeNode> ve(16385,0);
class CBTInserter
{
    public:
        queue<TreeNode*> q;
        int veEnd;
        
        CBTInserter(TreeNode* root)
        {
            TreeNode rubbish(0);
            veEnd = 0;
            ve[veEnd++] = (rubbish);
            q.push(root);
            Init();
            for(int i = 2; i < veEnd; i ++)
            {
                if((i&0x1)==1)
                {
                    ve[i/2].right = &ve[i];
                }
                else
                {
                    ve[i/2].left = &ve[i];
                }
            }
        //    cout << "??" << ve.size() << endl;
        }

        int insert(int v)
        {
            TreeNode t(v);
            ve[veEnd++] = (t);
            if((veEnd%2)==1)
            {
                ve[(veEnd-1)/2].left = &ve[veEnd-1];
            }
            else
            {
                ve[(veEnd-1)/2].right = &ve[veEnd-1];
            }
            return ve[(veEnd-1)/2].val;
        }

        TreeNode* get_root()
        {
            return &ve[1];
        }

        void Init()
        {
            while(!q.empty())
            {
                TreeNode t = *(q.front());
                ve[veEnd++] = (*(q.front()));
                if(q.front()->left)
                    q.push(q.front()->left);
                if(q.front()->right)
                    q.push(q.front()->right);
                q.pop();
            }
        }
};

哔了狗，一直忘记vector开辟空间以后会把所有元素的地址进行变动，然后疯狂debug