Leecode - 1038. Binary Search Tree to Greater Sum Tree

Given the root of 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.

As a reminder, a binary search tree is a tree that satisfies these constraints:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.
Note: This question is the same as 538: https://leetcode.com/problems/convert-bst-to-greater-tree/

Example 1:

Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]

1. 问题分析

按照题目的理解，要求写算法，将给定的二叉树，替换成新的二叉树。
新的节点的数值 = 原来老节点的数值 + 这个老节点右边所有的节点值的和。

2. 思路分析

三步走：
（1）中序遍历二叉树，然后将所有的值放在数组中；
（2）遍历这个数组中所有的元素，计算该元素和剩余元素之和的和；
（3）中序遍历二叉树，然后通这个数组的所有元素一一对应的替换到二叉树中。

3. 参考代码

class Solution {
public:
    void treeNodeCollect(TreeNode* root, vector<int> &result)
    {
        if(!root) return;
        
        treeNodeCollect(root->left, result);
        result.push_back(root->val);
        treeNodeCollect(root->right, result);
        
        return;
    }
    void updateTreeNodeValue(TreeNode* root, vector<int> &result, int &idx)
    {
        if(!root) return;
        
        updateTreeNodeValue(root->left, result, idx);
        
        root->val = result[idx];
        idx++;
        
        updateTreeNodeValue(root->right, result, idx);
    }
    
    TreeNode* bstToGst(TreeNode* root) {
        vector<int> treeVec;
        int idx = 0;
        treeNodeCollect(root, treeVec);
        
        vector<int> tmpVec = treeVec;
        for (int i = 0; i < treeVec.size(); i++)
        {
            int sum = 0;
            
            for (int j = i + 1; j < tmpVec.size(); j++)
            {
                sum += tmpVec[j];
            }
            treeVec[i] += sum;
        }
        
        updateTreeNodeValue(root, treeVec, idx);
        
        return root;
        
    }
};