Kth Smallest Element in a Binary Search Tree

Given the root of a BST and an integer k, return the kth smallest value in the tree, where k is 1-indexed.

Do not sort all node values. Stop traversal as soon as the kth value is found.

Follow-u...