构造二叉树用中序vector以及前序或者后序

TreeNode* preTree(vector<int>preVec, vector<int>inVec)
{
    if (preVec == inVec) return nullptr;
    int rootValue = preVec.front();
    //给后序用这个
    //rootValue = preVec.back();
    TreeNode* root = new TreeNode(rootValue);

    if (preVec.size() == 1) return root;

    int index = 0;
    while (index<inVec.size())
    {
        if (rootValue == inVec[index]) break;
        index++;
    }

    vector<int> leftInVec( inVec.begin(), inVec.begin() + index);
    vector<int> rightInVec(inVec.begin() + index + 1, inVec.end());

    preVec.erase(preVec.begin());
    //pop_back();
    vector<int> leftPreVec(preVec.begin() , preVec.begin() + leftInVec.size());
    vector<int> rightPreVec(preVec.begin() + leftInVec.size(), preVec.end());


    root->left= preTree(leftPreVec, leftInVec);
    root->right = preTree(rightPreVec, rightInVec);

    return root;


}