数据结构每日学习 Day11 把二叉搜索树转换为累加树

我是fw

AC:

package 二叉树;

import 二叉树.二叉树展开为链表.TreeNode;

public class 二叉搜索转化累加树 {
    public 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;
        }
    }
    int sum=0;
    public TreeNode convertBST(TreeNode root) {

        if(root==null){
            return null;
        }
        convertBST(root.right);
        sum+=root.val;
        root.val=sum;
        convertBST(root.left);






        return root;
    }
}