[leetcode] 538. Convert BST to Greater Tree

Description

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

分析

题目的意思是：给你一个二叉查找树，然后转换成为一棵greater树。

• 这道题是leetcode上的easy类型的题目，如果对递归比较熟的话，就能够熟练的写出来。我这里使用了一个全局的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* convertBST(TreeNode* root) {
        DFS(root);
        return root;
    }
    
    void DFS(TreeNode* root){
        if(!root){
            return;
        }
        DFS(root->right);
        root->val=sum+root->val;
        sum=root->val;
        DFS(root->left);
    }
};

代码二 （python）

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self,root):
        if(root is None):
            return 
        self.solve(root.right)
        root.val=self.sum+root.val
        self.sum=root.val
        self.solve(root.left)
        return root
        
    def convertBST(self, root: TreeNode) -> TreeNode:
        self.sum=0
        self.solve(root)

参考文献

【LeetCode】538. Convert BST to Greater Tree