Find the k-th smallest and k-th largest element in a binary search tree (BST).

Have a better answer?

Share your experience and earn credits toward your next interview session.