# 【Leetcode】Find the kth in the 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.

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?

Hint:

1. Try to utilize the property of a BST.

【思路】

BST的特点就是排序性，左边的节点一定比root小，右边的节点一定比root大。

k - left,就变成了新的k.

【代码】

Binary search:

public int kthSmallest(TreeNode root, int k) {
int count = countNodes(root.left);
if (k <= count) {
return kthSmallest(root.left, k);
<span style="background-color: rgb(255, 255, 102);">} else if (k > count + 1) {
return kthSmallest(root.right, k-1-count); // 1 is counted as current node</span>
}

return root.val;
}

public int countNodes(TreeNode n) {
if (n == null) return 0;

return 1 + countNodes(n.left) + countNodes(n.right);
}

DFS：

  // better keep these two variables in a wrapper class
private static int number = 0;
private static int count = 0;

public int kthSmallest(TreeNode root, int k) {
count = k;
helper(root);
return number;
}

public void helper(TreeNode n) {
if (n.left != null) helper(n.left);
count--;
if (count == 0) {
number = n.val;
return;
}
if (n.right != null) helper(n.right);
}

BFS :

 public int kthSmallest(TreeNode root, int k) {
Stack<TreeNode> st = new Stack<>();

while (root != null) {
st.push(root);
root = root.left;
}

while (k != 0) {
TreeNode n = st.pop();
k--;
if (k == 0) return n.val;
TreeNode right = n.right;
while (right != null) {
st.push(right);
right = right.left;
}
}

return -1; // never hit if k is valid
}

#### leetcode 230: Kth Smallest Element in a BST

2015-07-07 06:14:58

#### LeetCode 230: Kth Smallest Element in a BST

2015-07-02 14:27:17

#### leetcode 230. Kth Smallest Element in a BST-递归|非递归

2016-05-24 11:17:50

#### LeetCode-230. Kth Smallest Element in a BST (JAVA)二叉树第k小的数字

2017-04-29 10:36:27

#### LeetCode 230. Kth Smallest Element in a BST 解题报告

2016-02-16 15:27:50

#### leetcode 215: Kth Largest Element in an Array

2015-05-29 08:47:21

#### [leetcode 230]Kth Smallest Element in a BST----求二叉搜索树的第K小值

2016-03-09 21:51:39

#### 【LeetCode-面试算法经典-Java实现】【215-Kth Largest Element in an Array（数组中第K大的数）】

2015-08-28 06:57:17

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

2016-04-05 11:16:32

#### [LeetCode] 4 Find the kth smallest element in two sorted array

2015-07-12 20:03:12