剑指Offer 54.二叉搜索树的第k大节点

//自己写的
class Solution {
public:
   
    int kthLargest(TreeNode* root, int k) {
        vector<int>r=inorder(root);
        return r[k-1];
    
    }
    vector<int>res;
    vector<int> inorder(TreeNode*root){
        if(root==NULL)return res;        
        inorder(root->right);
        res.emplace_back(root->val);
        inorder(root->left);
        return res;
    }
};

class Solution {
public:
    vector<int>res;
    int kthLargest(TreeNode* root, int k) {
        // vector<int>r=inorder(root);
        inorder(root);
        return res[k-1];
    
    }
   
   void inorder(TreeNode*root){//中序遍历不用返回值
        if(root==NULL)return;        
        inorder(root->right);
        res.emplace_back(root->val);
        inorder(root->left);
    }
};