原题链接:https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/
int kthLargest(TreeNode* root, int k) {
vector<int> vr;
postOrder(root, vr);
return vr[k - 1];
}
void postOrder(TreeNode* root, vector<int>& vr) {
if (root == NULL) return ;
postOrder(root->right, vr);
vr.push_back(root->val);
postOrder(root->left, vr);
}