LeetCode 230. Kth Smallest Element in a BST（二叉搜索树中的第K个元素）

原题网址：https://leetcode.com/problems/kth-smallest-element-in-a-bst/

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

Follow up:
What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?

思路：使用二叉树的中序遍历，如果当前节点是中序遍历的第k个，则保存root.val的值。时间复杂度O(k)，空间复杂度O(1)。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    int kth;
    TreeNode prev;
    int count;
    int k;
    
    private void traverse(TreeNode root) {
        if (count >= k) return;
        if (root.left != null) traverse(root.left);
        prev = root;
        count ++;
        if (count == k) {
            kth = root.val;
            return;
        }
        if (root.right != null) traverse(root.right);
    }

    public int kthSmallest(TreeNode root, int k) {
        this.k = k;
        traverse(root);
        return kth;
    }
}