【Construct Binary Tree from Preorder and Inorder Traversal】cpp

/**
 * 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) {
        if ( preorder.size()==0 || inorder.size()==0 ) return NULL;
        return Solution::buildTreePI(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1);
    }
        static TreeNode* buildTreePI(
            vector<int>& preorder, 
            int beginP, int endP, 
            vector<int>& inorder, 
            int beginI, int endI)
        {
            // terminal condition & corner case
            if ( beginP>endP ) return NULL;
            // resurisve process
            TreeNode *root = new TreeNode(-1);
            root->val = preorder[beginP];
            // find the root node in inorder traversal
            int rootPosInorder = beginI;
            for ( int i = beginI; i <= endI; ++i )
            {
                if ( inorder[i]==root->val ) { rootPosInorder=i; break;}
            }
            int leftSize = rootPosInorder - beginI;
            int rightSize = endI - rootPosInorder;
            root->left = Solution::buildTreePI(preorder, beginP+1, beginP+leftSize, inorder, beginI, rootPosInorder-1);
            root->right = Solution::buildTreePI(preorder, endP-rightSize+1, endP, inorder, rootPosInorder+1, endI);
            return root;
        }
};