因为为搜索二叉树,对二叉树进行一次反中序遍历即可
/**
-
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:void setvor(vector&cc,TreeNode* root)
{
if(root== NULL)return ;
setvor(cc,root->right);
cc.push_back(root->val);
setvor(cc,root->left);
}
int kthLargest(TreeNode* root, int k)
{
vectorcc;
setvor(cc,root);
return cc[k-1];}
};