leetcode 剑指 Offer 54. 二叉搜索树的第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> res;
    vector<int> t(TreeNode* root)
    {
        if(root != nullptr)
        {
            res.push_back(root->val);
            t(root->left);
            t(root->right);
        }
        return res;
    }
    int kthLargest(TreeNode* root, int k) {
        vector<int> tmp = t(root);
        sort(tmp.begin(), tmp.end(), greater<int>());
        return tmp[k - 1];
    }
};