[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 {
    public TreeNode convertBST(TreeNode root) {
        func(root);
        return root;
    }
    public int sum = 0;
    public void func(TreeNode root){
        if(root == null) return;
        func(root.right);
        root.val += sum;
        sum = root.val;
        func(root.left);
    }
}