题目链接:https://leetcode.com/problems/convert-bst-to-greater-tree/#/description
/**
* 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 tmp=0;
TreeNode* convertBST(TreeNode* root) {
if(root==NULL) return NULL;
convertBST(root->right); // 右
root->val=(tmp+=root->val); // 根
convertBST(root->left); // 左
return root;
}
};