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.

class Solution {
public:
    TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (preorder.size() <= 0)
            return NULL;
            
        if (preorder.size() != inorder.size())
            return NULL;
            
        TreeNode* root = new TreeNode(0);
        root = buildTree(preorder, 0, preorder.size()-1, inorder,0, preorder.size()-1);
        
        return root;
    }
    
    
    TreeNode* buildTree(vector<int> &preorder, int preStart, int preEnd, vector<int> &inorder, int inStart, int inEnd){
        if (preEnd < preStart )
            return NULL;
            
        TreeNode* root = new TreeNode(0);
        root->val = preorder.at(preStart);
        if (preEnd== preStart)    
    		return root;
            
        int i;
        for(i = 0; i < inorder.size(); i++){
            if (inorder.at(inStart+i) == root->val)
                break;
        }
        
        root->left  = buildTree(preorder, preStart+1, preStart+i,inorder,inStart, inStart + i-1);
        root->right = buildTree(preorder, preStart+1+i, preEnd,inorder,inStart+ i+1, inEnd);
        return root;
    }
};

1. 最开始打算利用vector<int> c(begin, end)来复制每次所需要的子vector，但是发现当子树是空的时候，会出现run error。

注意vector<int> c(begin, end) 是复制 [begin,end)的内容，不包括end！！！

2. 改用push_back, 代码的确很简单，但是大数量时候占用太多memory。

3, 最后才改成标注起始，结束位置。