[leetcode]1038. Binary Search Tree to Greater Sum Tree

最新推荐文章于 2020-04-21 22:19:10 发布

T2777

最新推荐文章于 2020-04-21 22:19:10 发布

阅读量144

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/T2777/article/details/99988877

版权

Leetcode 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

问题描述：

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]
Note:

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

问题读起来好像有点复杂，大意就是给出一个二叉搜索树，要求将每个结点的值修改位所有原树中结点值大于或等于该结点值的结点值之和，就比如 6 -> 21 是因为原二叉树中 6 + 7 + 8 = 21。

思路是先修改最右下角的结点，再修改中间的结点，最后再修改左边结点的值即可。下面的方法中bstToGst虽然要返回一个值但也可以不用TreeNode去接这个值，最重要的是用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 {
    int sum = 0;
public:
    TreeNode* bstToGst(TreeNode* root) {
        if(root != NULL)
        {
            bstToGst(root->right);
            root->val += sum;
            sum = root->val;
            bstToGst(root->left);
        }
        return root;
    }
};