Kth Smallest in BST (#230)
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.
Company Tags: Google
Core Concept: Tree, In-order Traversal
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.
Company Tags: Google
Core Concept: Tree, In-order Traversal