solution:
二叉搜索树的中序遍历是一个升序数组,再返回第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> inorder;
int kthLargest(TreeNode* root, int k) {
dfs(root);
return inorder[inorder.size() - k];
}
void dfs(TreeNode *root) {
if(root == NULL) return;
dfs(root->left);
inorder.push_back(root->val);
dfs(root->right);
}
};
反向中序遍历,在计算遍历结点的个数,减少消耗内存
/**
* 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 ans = 0,cnt = 0;
int kthLargest(TreeNode* root, int k) {
dfs(root, k);
return ans;
}
void dfs(TreeNode *root, int k) {
if(root == NULL) return;
dfs(root->right, k);
if(++cnt == k) {
ans = root->val;
return;
}
dfs(root->left, k);
}
};