Medium Accuracy: 49.44%
Submissions: 46960 Points: 4
Given a BST and an integer K. Find the Kth Smallest element in the BST.
1 3K = 2
K = 5
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).