Kth Smallest Element in a BST

medium

Acceptance: 49%

BST

In a binary search tree, find the element with the k-th smallest value. The parameter k is 1-indexed, meaning k=1 asks for the minimum element.

Example 1:

Input:root = [7,3,10,1,5], k = 2

Output:3

Example 2:

Input:root = [4,2,6,1,3,5,7], k = 5

Output:5

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}