LeeCod : 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

代码
中序访问，注意先right；以及tmp和val互相依赖修改。

/**
 * 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) {
        if(root==null) return root;
        
        convertBST(root.right);
        
        int tmp = root.val;
        root.val += sum;
        sum += tmp;
        
        convertBST(root.left);
        
        return root;
    }
}