6.29 把二叉搜索树转换为累加树——【LeetCode】

class Solution {
    int sum;
    public TreeNode convertBST(TreeNode root) {
        sum = 0;
        convertBST1(root);
        return root;
    }
    // 按右中左顺序遍历，累加即可
    private void convertBST1(TreeNode root) {
        if(root == null){
            return;
        }
        convertBST1(root.right);//递归到最右边
        sum += root.val;
        root.val = sum;
        convertBST1(root.left);
    }

}

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}