1 题目
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?
2 尝试解
class Solution {
public:
int kthSmallest(TreeNode* root, int k) {
vector<int> result;
inorder(root,result);
return result[k-1];
}
void inorder(TreeNode* root, vector<int>&result){
if(root == NULL) return;
if(root->left!=NULL) inorder(root->left,result);
result.push_back(root->val);
if(root->right != NULL) inorder(root->right,result);
}
};
3 标准解
class Solution {
public:
void inorder(TreeNode* root, vector<int> &res){
if(!root)
return;
inorder(root->left, res);
res.push_back(root->val);
inorder(root->right,res);
}
int kthSmallest(TreeNode* root, int k) {
if(!root)
return -1;
vector<int> arr;
inorder(root, arr);
return arr[k-1];
}
};
3 标准解
class Solution {
public:
void inorder(TreeNode* root, vector<int> &res){
if(!root)
return;
inorder(root->left, res);
res.push_back(root->val);
inorder(root->right,res);
}
int kthSmallest(TreeNode* root, int k) {
if(!root)
return -1;
vector<int> arr;
inorder(root, arr);
return arr[k-1];
}
};