LeetCode.538 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.

Example:

Input: The root of a Binary Search Tree like this:
              5
            /   \
           2     13

Output: The root of a Greater Tree like this:
             18
            /   \
          20     13

分析：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int sum=0;
    public TreeNode convertBST(TreeNode root) {
        //给定规则二叉树（左子树均小于根节点，右子树均大于等于根节点），更改每个节点值（为比其原来值大的所有数之和）
        //思路：从最左边开始记录sum，递归求解每个节点右子树和其节点之和。
        
        sumTree(root);
        return root;
    }
    //求和
    public void sumTree(TreeNode root){
        if(root==null) return ;
        sumTree(root.right);
        root.val+=sum;
        sum=root.val;
        sumTree(root.left);
    }
}