UberCodingMembers
Kth Smallest Element in a BST
Members only
Given the root of a binary search tree and an integer k, return the kth smallest value (1-indexed) in the tree.
SWE
medium
bst
tree
tree-traversal
recursion
Frequency
Low
Last asked
2026-04-13
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...