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

Subscribe to see which companies asked this question.

题意：给出一颗二叉搜索树，将每个结点的值都加上所有比他值大的结点的值，并返回。

思路：利用中序遍历，先右子树，再根节点，再左子树，然后记录累加的sum值，将结点的值替换。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void solution(TreeNode* root, int& sum) {
        if (root == NULL) return;
        solution(root -> right, sum);
        root -> val += sum;
        sum = root -> val;
        solution(root -> left, sum);
    }
    TreeNode* convertBST(TreeNode* root) {
        int sum = 0;
        solution(root, sum);
        return root;
    }
    
};