从前序与中序遍历序列构造二叉树(递归法)

题目：

根据一棵树的前序遍历与中序遍历构造二叉树。

注意:
你可以假设树中没有重复的元素。

题解：

/**
 * 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,int pre_st,int pre_ed,int in_st,int in_ed) {
        if(in_st>in_ed) return NULL;
        TreeNode* root=new TreeNode(preorder[pre_st]);
        if(pre_st==pre_ed)
            return root;
        int loc=-1;
        for(int i=in_st;i<=in_ed;i++)
        {
            if(inorder[i]==preorder[pre_st])
            {
                loc=i;
                break;
            }
        }
        root->left = buildTree(preorder, inorder, pre_st+1, pre_st+loc-in_st,in_st,loc-1);
        root->right = buildTree(preorder, inorder, pre_st+loc-in_st+1, pre_ed, loc+1,in_ed);
        return root;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return buildTree(preorder,inorder,0,preorder.size()-1,0,inorder.size()-1);
    }
};