230. Kth Smallest Element in a BST (M)

Kth Smallest Element in a BST (M)

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.

Example 1:

Input: root = [3,1,4,null,2], k = 1
   3
  / \
 1   4
  \
   2
Output: 1

Example 2:

Input: root = [5,3,6,2,4,null,null,1], k = 3
       5
      / \
     3   6
    / \
   2   4
  /
 1
Output: 3

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?

---

题意

找到BST中第k小的数。

思路

BST的中序遍历是递增序列，因此可以先进行中序遍历再找到第k小。

---

代码实现 - 中序遍历(递归)

class Solution {
    public int kthSmallest(TreeNode root, int k) {
        List<Integer> list = new ArrayList<>();
        preOrder(root, list);
        return list.get(k - 1);
    }

    private void preOrder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        preOrder(root.left, list);
        list.add(root.val);
        preOrder(root.right, list);
    }
}

代码实现 - 中序遍历(迭代)

class Solution {
    public int kthSmallest(TreeNode root, int k) {
        int count = 0;
        int ans = 0;

        Deque<TreeNode> stack = new ArrayDeque<>();
        TreeNode cur = root;
        while (cur != null || !stack.isEmpty()) {
            while (cur != null) {
                stack.push(cur);
                cur = cur.left;
            }
            cur = stack.pop();
            count++;
            if (count == k) {
                ans = cur.val;
                break;
            }
            cur = cur.right;
        }

        return ans;
    }
}