LeetCode - 538. Convert BST to Greater Tree

最新推荐文章于 2023-02-25 22:41:55 发布

转载最新推荐文章于 2023-02-25 22:41:55 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wxisme/p/7325833.html

本文介绍了一种将二叉搜索树（BST）转换为Greater Tree的方法，其中每个节点的值变为原值加上所有大于该值的节点之和。通过递归地遍历右子树、更新节点值和遍历左子树的过程实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    int sum = 0;
    public TreeNode convertBST(TreeNode root) {
        if (root == null)
            return null;
        
        convert(root);
        return root;
    }
    
    public void convert(TreeNode root) {
        if (root == null)
            return ;
        convert(root.right);
        root.val += sum;
        sum = root.val;
        convert(root.left);
    }
    
}