Kth Smallest Element in a BST - LeetCode
Given the root of a binary search tree, and an integer k, return the smallest value (1-indexed) of all the values of the nodes in the tree.
https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/