Timer is Running

Kth largest element in BST
Submissions: 27176   Accuracy: 42.26%   Difficulty: Easy   Marks: 2

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

Example 1:

```Input:
4
/   \
2     9
k = 2
Output: 4
```

Example 2:

```Input:
9
\
10
K = 1
Output: 10
```

You don't need to read input or print anything. Your task is to complete the function kthLargest() which takes the root of the BST and an integer K as inputs and returns the Kth largest element in the given BST.

Expected Time Complexity: O(H + K).
Expected Auxiliary Space: O(H) , where H is the height of the tree.

Constraints:
1 <= N <= 1000
1 <= K <= N

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth
Author: saksham seth

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.