Kth largest element in BST (GFG)

class Solution
{
    public:
    void inorder(Node *root, int &K, int &ans) {
        if(root == nullptr || ans != -1) return;
        inorder(root -> right, K, ans);
        K--;
        if(K == 0) {
            ans = root -> data;
            return;
        }
        inorder(root -> left, K, ans);
    }
    int kthLargest(Node *root, int K)
    {
        //Your code here
        int ans = -1;
        inorder(root, K, ans);
        return ans;
    }
};