Problem:

Find k-th smallest element in BST (Order Statistics in BST)

Given root of binary search tree and K as input, find K-th smallest element in BST.

Latest Source Code:

Github: BSTKthSmallest.java

**Output:**

20 / \ / \ / \ / \ 3 30 / \ / \ / \ / \ 2 10 27 35 / \ 26 28 2nd Smallest : 3 4th Smallest : 20 7th Smallest : 28 Exception in thread "main" java.lang.RuntimeException: No such element at com.hrishikesh.practices.binarysearchtree.BSTKthSmallest.findKthSmallest(BSTKthSmallest.java:29)