题意:给出一棵二叉搜索树,求第k小的元素。
思路:中序遍历,直到结果中包含k个元素。
/**
* 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:
vector<int> re;
int num;
int kthSmallest(TreeNode* root, int k) {
num = k;
dfs(root);
return re[re.size() - 1];
}
void dfs(TreeNode* root) {
if(re.size() >= num) return;
if(root == NULL) return;
dfs(root->left);
if(re.size() >= num) return;
else re.push_back(root->val);
dfs(root->right);
return;
}
};