Convert BST to Greater Tree

问题描述：Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater 

        than the original key in BST.

意思：题目大意：给定一棵二叉搜索树，将它转化为更大的二叉树，规则是：结点的值 = 该结点的值 + 所有比它大的结点的值的和。

           转化后，二叉树变成左边大，右边小，刚好和二叉搜索树相反

样例

Given a binary search Tree ｀{5,2,3}｀:

              5
            /   \
           2     13

Return the root of new tree

             18
            /   \
          20     13

思路：对二叉搜索树进行右子数-根节点-左子树的遍历，，右子数值不变，根节点值=根节点+右子数，左子树值=根节点+左子树+右子数

代码：

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param root the root of binary tree
     * @return the new root
     */
    TreeNode* convertBST(TreeNode* root) {
        // Write your code here
        if(root==NULL) return NULL;
        convertBST(root->right);
        root->val+=sum;
        sum=root->val;
        convertBST(root->left);
        return root;
    }
    private:int sum=0;
};