Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
Given the `root` of a binary search tree, and an integer `k`, return the *k*-th smallest value (1-indexed) of all the values of the nodes in the tree.
Example
root = [3,1,4,null,2], k = 1 → 1
Constraints
1 ≤ k ≤ tree size ≤ 10⁴ · 0 ≤ Node.val ≤ 10⁴
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.