Kth Smallest Element in a BST
MediumP2Coding
Given the root of a binary search tree and an integer k, return the k-th smallest value in the tree, counting from 1.
Example 1
- Input
- root = [3,1,4,null,2], k = 1
- Output
- 1
Example 2
- Input
- root = [5,3,6,2,4,null,null,1], k = 3
- Output
- 3
- Why
- In sorted order the values are 1, 2, 3, 4, 5, 6.
Constraints
- 1 <= k <= number of nodes <= 10^4
- 0 <= Node.val <= 10^4
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 9. ⌘Enter runs, ⌘⇧Enter submits.