Construct Tree from Inorder & Preorder (GFG)

class Solution{
    public:
    Node* buildTree(int in[],int pre[], int n)
    {
        // Code here
        if(n == 0) return nullptr;
        int pos;
        for(int i = 0; i < n; i++) {
            if(in[i] == pre[0]) {
                pos = i;
                break;
            }
        }
        Node *root = new Node(pre[0]);
        root -> left = buildTree(in, pre + 1, pos); 
        root -> right = buildTree(in + pos + 1, pre + pos + 1, n - 1 - pos);
        return root;
    }
};