LeetCode 面试题07. 重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

 

例如，给出

前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：

    3
   / \
  9  20
    /  \
   15   7
 

限制：

0 <= 节点个数 <= 5000

 

注意：本题与主站 105 题重复：https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

 

/**
 * 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>& preorder, vector<int>& inorder) {
        return buildTreeHelper(preorder, 0, preorder.size() - 1, inorder, 0, inorder.size() - 1);
    }

    TreeNode* buildTreeHelper(vector<int>& preorder, int pre_begin, int pre_end, vector<int>& inorder, int in_begin, int in_end) {
        if (pre_begin > pre_end)
            return NULL;
        
        int in_mid;
        for (in_mid = in_begin; in_mid <= in_end && inorder[in_mid] != preorder[pre_begin]; ++in_mid)
            ;
        
        TreeNode* root = new TreeNode(preorder[pre_begin]);
        root->left = buildTreeHelper(preorder, pre_begin + 1, pre_begin + in_mid - in_begin, inorder, in_begin, in_mid - 1);
        root->right = buildTreeHelper(preorder, pre_begin + in_mid - in_begin + 1, pre_end, inorder, in_mid + 1, in_end);
        return root;
    }
};