LeetCode 230. Kth Smallest Element in a BST（二叉树）

Kth Smallest Element in a BST

Medium

Given a binary search tree, write a function kth Smallest 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 kth Smallest routine?

题意

在二叉搜索树中找第k小的元素

思路

中序遍历二叉搜索树

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int cnt = 0;
    
    public int kthSmallest(TreeNode root, int k) {
        return inOrder(root, k);
    }
    
    private int inOrder(TreeNode root, int k)
    {
        int lval = 0, rval = 0;
        if (root.left != null)
        {
            lval = inOrder(root.left, k);
        }
        this.cnt++;
        if (this.cnt == k)
        {
            return root.val;
        }
        else if (this.cnt > k)
        {
            return lval;
        }
        if (root.right != null)
        {
            rval = inOrder(root.right, k);
        }
        return rval;
    }
}