Find the Kth smallest element in a BST.

KthSmallest.java

static int count, element;

private static void kthSmallestHelper(TreeNode root, int k) {
    if(root == null)
        return;

    kthSmallestHelper(root.left, k);

    if(k == ++count) {
        element = root.val;
        return;
    }
    else
        kthSmallestHelper(root.right, k);

}

public int kthSmallest(TreeNode root, int k) {
    count = 0;
    element = root.val;
    kthSmallestHelper(root, k);
    return element;
}