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.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?
/**
* 将中序遍历的代码不变,直接返回result[k-1]即可
*/
/**
* 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) {
vector<int> result;
stack<TreeNode*> s;
TreeNode* temp = root;
while (temp || !s.empty()) {
if (temp) {
s.push(temp);
temp = temp->left;
}
else {
temp = s.top();
s.pop();
result.push_back(temp->val);
temp = temp->right;
}
}
return result[k-1];
}
};