Medium

Quiz

#230 Kth Smallest Element in a BST

APPROACH

Given the root of a binary search tree and a positive integer k, return the k-th smallest node value in the tree using 1-based indexing.

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

1 of 4

1:00

What is the optimal approach for this problem?