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.

样例

Given a binary search Tree ｀{5,2,3}｀:

              5
            /   \
           2     13

Return the root of new tree

             18
            /   \
          20     13

二.解题思路

把每个节点值加上所有比他大的节点值总和当作新的节点值,先遍历右子树,计算累加和同时更新节点值,再遍历左子树.

三.实现代码

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param root the root of binary tree
     * @return the new root
     */
    TreeNode* convertBST(TreeNode* root) {
        // Write your code here
        if(root==NULL) return NULL;
        convertBST(root->right);
        root->val+=sum;
        sum=root->val;
        convertBST(root->left);
        return root;
    }
private:
      int sum=0;
};

四.感想

sum要在函数外赋初值,不然累加和会丢失.