Leetcode之 Binary Search Tree to Greater Sum Tree

题目：

Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val.

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.

 

Example 1:

Input: [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]

 

Constraints:

1. The number of nodes in the tree is between 1 and 100.
2. Each node will have value between 0 and 100.
3. The given tree is a binary search tree.

Note: This question is the same as 538: https://leetcode.com/problems/convert-bst-to-greater-tree/

代码：

/**
 * 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 helper(TreeNode*& root, int& past) {
    if (!root) { return; }
    helper(root->right, past);
    root->val += past;
    past = root->val;
    helper(root->left,past);
}
TreeNode* bstToGst(TreeNode* root) {
    int b = 0;
    helper(root,b);
    return root;
}
};

想法：首先要申请题，理解题目意思了再开始做。否则就是浪费时间。

思路：先访问右节点，再访问中间节点，再访问左节点。past参数表示比当前节点值大的节点值之和，遍历过程中要改变两个量，一个是当前节点的值，一个是past变量。