leetcode_114 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]

Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

前序遍历: 开始索引 pstart

中序遍历：开始索引 istart 和结束索引 iend

前序遍历的开始索引从中间index把中序遍历分为左右两个子树，左子树的根节点为pstart + 1， 右子树的根节点为 pstart + index - istart + 1

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* build_Pre_Inorder(vector<int> &preorder,int pstart,
                                vector<int> &inorder,int istart, int iend)
    {
        if(pstart > preorder.size()-1 || istart > iend)
        {
            return NULL;
        }
        TreeNode* root = new TreeNode(preorder[pstart]);
        int index = istart;
        while(inorder[index] != preorder[pstart])
        {
            index++;
        }
        root->left = build_Pre_Inorder(preorder,pstart+1,inorder,istart,index-1);
        root->right = build_Pre_Inorder(preorder,pstart+index-istart+1,inorder,index+1,iend);
        
        return root;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return build_Pre_Inorder(preorder,0,inorder,0,inorder.size()-1);
    }
};