Kth smallest element in a BST
Given the root of a binary search tree and an integer k, return the k-th smallest value in it, ideally stopping the in-order walk as soon as you reach it.
UberTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.