Kth Smallest Element in a BST

medium · verified · 76.5% accepted · 12,636 likes · top 88%

tree · depth-first search · binary search tree · binary tree

Description

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 1:

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

Output: 1

Example 2:

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

Output: 3

Solution