由中序序列和前序序列重建二叉树

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
        int n = pre.size();
        int m = vin.size();
        if(n!=m || n == 0)
            return NULL;
        return construct(pre, vin, 0, n-1, 0, m-1);
    }
 
    TreeNode* construct(vector<int>& pre, vector<int>& vin, int l1, int r1, int l2, int r2)
    {
        TreeNode* root = new TreeNode(pre[l1]);
        if(r1 == l1)
        {
            return root;
        }
        int val = pre[l1];
        int index;
        for(index = l2; index <= r2; index ++)
        {
            if(vin[index] == val)
                break;
        }
        int left_tree_len  = index - l2;
        int right_tree_len = r2 - index;
        if(left_tree_len > 0)
            root->left = construct(pre, vin, l1+1, l1+left_tree_len, l2, index-1);
        if(right_tree_len >0 )
            root->right = construct(pre, vin, l1+1+left_tree_len, r1, index+1, r2);
        return root;
    }
};

在这里需要注意的是：给定二叉树的前序遍历（或者后序遍历）和中序遍历可以重建二叉树，而对于后序遍历和前序遍历则不能确定二叉树。(得到二叉树就可以得到相应的后序遍历序列了，代码如下)

vector<int>PostOrder;

void visit(TreeNode *t)
{
    PostOrder.push_back(t->val);
    return ;
}

void postOrder(TreeNode* r)
{
    if(r!=NULL)
    {
        postOrder(r->left);
        postOrder(r->right);
        visit(r);
    }
}

void getpost(vector<int>pre,vector<int>vin)
{
    TreeNode* root=reConstructBinaryTree(pre,vin);
    vector<int>temp;
    if(root!=NULL)
    {
        postOrder(root);
    }
    return ;
}