Kth Smallest Element in a BST LeetCode solution in Java

1
class Solution {
2
  private int count = 0;
3
  private int result = 0;
4

5
  public int kthSmallest(TreeNode root, int k) {
6
    inorderTraversal(root, k);
7
    return result;
8
  }
9

10
  private void inorderTraversal(TreeNode node, int k) {
11
    if (node == null || count >= k) {
12
      return;
13
    }
14

15
    inorderTraversal(node.left, k);
16

17
    count++;
18
    if (count == k) {
19
      result = node.val;
20
      return;
21
    }
22

23
    inorderTraversal(node.right, k);
24
  }
25
}