Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· trees Mock interview

Kth Smallest Element in a BST

Given the root of a binary search tree and an integer `k`, return the k-th smallest value (1-indexed) among all node values.

Examples

in: root = [3,1,4,null,2], k = 1

out: 1

smallest value

Constraints

1 <= k <= number of nodes <= 10^4

Hints

target: O(height + k) time⌘↩ run · ⇧⌘↩ submit