leetcode刷题笔记(Golang)--230. Kth Smallest Element in a BST

230. 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.

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?

花花酱

func kthSmallest(root *TreeNode, k int) int {
	return kthSmallCore(root, &k)

}

func kthSmallCore(root *TreeNode, k *int) int {
	if root == nil {
		return -1
	}
	v := kthSmallCore(root.Left, k)
	if *k == 0 {
		return v
	}
	*k--
	if *k == 0 {
		return root.Val
	}
	return kthSmallCore(root.Right, k)
}