leetcode105

105. Construct Binary Tree from Preorder and Inorder Traversal

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]

/**
 * 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) {
        //  已知先序和中序构建一棵二叉树
        TreeNode* root = NULL;
        if (preorder.size() > 0) {
            root = BuildTree(preorder, inorder, 0, preorder.size() - 1, 0, inorder.size() - 1);
        }
         return root;
    }

    TreeNode* BuildTree(vector<int>& preorder, vector<int>& inorder, int hl, int hr, int tl, int tr) {
        int index = 0;
        int lenl = 0;
        int lenr = 0;
        for (index = 0; inorder[index] != preorder[hl]; index++);
        lenl = index - tl;
        lenr = tr - index;
        TreeNode* root = new TreeNode(preorder[hl]);
        root -> val = preorder[hl];
        
        if (lenl) {
            root -> left = BuildTree(preorder, inorder, hl + 1, hl + lenl, tl, tl + lenl - 1);
        } else {
            root -> left = NULL;
        }
        if (lenr) {
            root -> right = BuildTree(preorder, inorder, hr - lenr + 1, hr, tr - lenr + 1, tr);
        } else {
            root -> right = NULL;
        }
        
        return root;
    }
};