Kth Smallest Element in a BST · Coding Interview Practice

Kth Smallest Element in a BSTGiven the root of a binary search tree and an integer k, return the kth smallest value (1-indexed).Constraints

The number of nodes is n

1 <= k <= n <= 10^4

0 <= Node.val <= 10^4

Examples

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

Input: root = [5,3,6,2,4,null,null,1], k = 3 Output: 3

LetsDiscuss

Loading your session…