# [leetcode] 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.

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?

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int kthSmallest(TreeNode* root, int k) {
if(root == NULL)return 0;
int value = 0;
int index = 0;
InOrder(root, k, value, index);
return value;
}
void InOrder(TreeNode* root, int k, int& value, int& before) {
if(root == NULL)return;
InOrder(root->left, k, value, before);
before++;
if(before == k){
value = root->val;
before = k;
return;
}
else if(before > k)return;
InOrder(root->right, k, value, before);
}
};

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

2016-05-24 11:17:50

#### 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-02-16 15:27: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----求二叉搜索树的第K小值

2016-03-09 21:51:39

#### [leetcode] 378. Kth Smallest Element in a Sorted Matrix

2016-08-02 16:38:33

#### [leetcode] 378. Kth Smallest Element in a Sorted Matrix 解题报告

2016-08-20 15:43:59

#### LeetCode—378. Kth Smallest Element in a Sorted Matrix

2016-08-02 10:20:37

#### 【Leetcode】Kth Smallest Element in a Sorted Matrix

2016-08-01 21:54:16