Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Kth Smallest Element in a BST · medium trees interview problem · Larpy

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.

Figure

level order, nulls omitted

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

More trees problems

Maximum Depth of a Binary Treeeasy
Balanced Binary Treeeasy
Diameter of Binary Treeeasy
Subtree of Another Treeeasy
Count Complete Tree Nodeseasy
Path Sumeasy