Given a Binary Search Tree. Your task is to complete the function which will return the kth largest element without doing any modification in the Binary Search Tree.

Examples:

Input:
      4
    /   \
   2     9
k = 2 
Output: 4
Explanation: 2nd Largest element in BST is 4

Input:
       9
        \ 
          10
k = 1
Output: 10
Explanation: 1st Largest element in BST is 10

Input:
      4
    /   \
   2     9
k = 3 
Output: 2
Explanation: 3rd Largest element in BST is 2

Constraints:
1 <= number of nodes <= 10⁵
1 <= node->data <= 10⁵
1 <= k <= number of nodes