Kth Smallest Element in BST
#230
Medium
Binary Tree
O(h + k)
O(h)
Amazon
Microsoft
Facebook
Google
Problem Description
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.