首页 > itarticle > [leetcode] problem 538 – convert bst to greater tree

[leetcode] problem 538 – convert bst to greater tree

admin 11月 13, 2020 0

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:

1
2
3

   5
 /   
2     13

Output: The root of a Greater Tree like this:

1
2
3

   18
  /   
20     13

Code

public class  {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

private int sum = 0;

public TreeNode convertBST(TreeNode root) {
    if (root == null)
        return null;

    if (root.right != null)
        convertBST(root.right);

    sum += root.val;
    root.val = sum;

    if (root.left != null)
        convertBST(root.left);

    return root;
}