[Leetcode] Construct Binary Tree from Preorder and Inorder Traversal

/**
 * Definition for binary tree
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return build(preorder, inorder, 0, inorder.size() - 1, 0);
    }
    
    TreeNode* build(vector<int>& preorder, vector<int>& inorder, int start, int end, int f)
    {
        if (start > end) return NULL;
        
        TreeNode* res = new TreeNode(preorder[f]);
        
        int idx = start;
        while (idx <= end)
        {
            if (inorder[idx] == res->val)
                break;
            
            ++idx;
        }
        
        res->left = build(preorder, inorder, start, idx - 1, f + 1);
        res->right = build(preorder, inorder, idx + 1, end, f + idx + 1 - start);
        
        return res;
    }
};