[LeetCode] 538. Convert BST to Greater Tree

题：https://leetcode.com/problems/convert-bst-to-greater-tree/description/

题目

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

题目大意

把二叉查找树每个节点的值都加上比它大的节点的值

思路

二叉查找树 从左子树开始的中序遍历可获得 增序列表。从右子树开始的中序遍历可获得 减序列表。

所以在本题情况下 当前节点val 置为 所有比它大的节点的和 再加上 本节点的val。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int tres = 0;
    public void in_order_traversal(TreeNode root){
        if(root==null)
            return;
        in_order_traversal(root.right);
        tres += root.val;
        root.val = tres;
        in_order_traversal(root.left);
    }
    
    public TreeNode convertBST(TreeNode root) {
        in_order_traversal(root);
        return root;
    }
}