Timer is Running

k-th smallest element in BST
Submissions: 25070   Accuracy:


  Difficulty: Medium   Marks: 4
Associated Course(s):   Amazon SDE Test Series

Given a BST and an integer K. Find the Kth Smallest element in the BST. 

Example 1:

    /   \
   1     3
K = 2
Output: 2

Example 2:

      /  \
     1    3
K = 5
Output: -1


Your Task:
You don't need to read input or print anything. Your task is to complete the function KthSmallestElement() which takes the root of the BST and integer K as inputs and return the Kth smallest element in the BST, if no such element exists return -1.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).

1<=Number of nodes<=100000


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

Contributor: Saksham Raj Seth, Harshit Sidhwa
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.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.