Kth Smallest Element in a BST
Medium
Trees
•
Grind 75NeetCode 150
Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree.

Constraints:

  • The number of nodes in the tree is n
  • 1 <= k <= n <= 104
  • 0 <= Node.val <= 104