重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。
假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，
则重建二叉树并返回。

根据前序遍历与中序遍历，重建二叉树

/**
 * 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) {
        TreeNode* result = buildTree(&pre[0], &vin[0], pre.size());
        return result;
    }
    
    TreeNode* buildTree(int* pre, int* vin, int num)
    {
        if (num == 0)
            return nullptr;
        int root = pre[0];
        int leftLen = 0;
        while (vin[leftLen] != root)
            leftLen++;
        int rightLen = num - leftLen - 1;
        TreeNode* node = new TreeNode(root);
        node->left = buildTree(pre + 1, vin, leftLen);
        node->right = buildTree(pre + leftLen + 1, vin + leftLen + 1, rightLen);
        return node;
    }
};

Leecode：从中序遍历与后序遍历重建二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if (inorder.empty() || postorder.empty())
        return nullptr;
        TreeNode* result = build(&inorder[0], &postorder[postorder.size() - 1], postorder.size());
        return result;
    }
    TreeNode* build(int* inorder, int* postorder, int num)
    {
        if (num == 0)
            return nullptr;
        int root = *postorder;
        int leftLen = 0;
        while(inorder[leftLen] != root)
            leftLen++;
        int rightLen = num - 1 - leftLen;
        TreeNode* node = new TreeNode(root);
        node->left = build(inorder, postorder - 1 - rightLen, leftLen);
        node->right = build(inorder + leftLen + 1, postorder - 1, rightLen);
        return node;
    }
};