题目:
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.
思路:
思路1: 堆排序(没用用到binary search tree的性质,可行,但不切和题目)。
思路2: 中序遍历。对访问元素的次序进行计数,一旦找到第k个,则返回true,然后一路绿灯返回到kthSmallest函数处。
代码实现:
思路1:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void f(TreeNode *root, vector<int> &heap_arr){
if (root == nullptr){
return ;
}
if (root->val < heap_arr[0]) {
pop_heap(heap_arr.begin(), heap_arr.end()); // 把顶端元素放到了数组的最后
heap_arr[heap_arr.size() - 1] = root->val;
push_heap(heap_arr.begin(), heap_arr.end()); // 把数组最后的元素调整到合适位置
}
f(root->left, heap_arr);
f(root->right, heap_arr);
}
int kthSmallest(TreeNode* root, int k) {
vector<int> heap_arr(k, INT_MAX);
make_heap(heap_arr.begin(), heap_arr.end());
f(root, heap_arr);
return heap_arr[0];
}
};
思路2:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool f(TreeNode *root, int &number, int &k, int &ret){
if (root == nullptr){
return false;
}
if (f(root->left, number, k, ret)){
return true;
}
++number;
if (number == k){
ret = root->val;
return true;
}
if (f(root->right, number, k, ret)){
return true;
}
return false;
}
int kthSmallest(TreeNode* root, int k) {
int number = 0;
int ret;
f(root, number, k, ret);
return ret;
}
};