leetcode刷题｜修剪二叉搜索树 二叉搜索树转为累加树

目录

669.修剪二叉搜索树

108.将有序数组转成平衡二叉树

538.把二叉搜索树转换成累加树

---

669.修剪二叉搜索树

力扣链接

题解

Java代码

/**
 * Definition for a binary tree node.
 * 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;
 *     }
 * }
 */
class Solution {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        //确定终止条件
        if (root == null) {
            return null;
        }
        //如果节点<low，那么遍历节点的右子树（二叉树的特性，左孩子小于根节点，右孩子大于根节点），寻找在区间内的头节点
        if (root.val < low) {
            TreeNode right = trimBST(root.right, low, high);
            return right;
        }
        //如果节点>high，那么遍历节点的左子树，寻找在区间内的头节点
        if (root.val > high) {
            TreeNode left = trimBST(root.left, low,high);
            return left;
        }
        

        //确定单层逻辑
        root.left = trimBST(root.left, low, high);
        root.right = trimBST(root.right, low, high);
        return root;
    }
}

108.将有序数组转成平衡二叉树

力扣链接

题解

Java代码

/**
 * Definition for a binary tree node.
 * 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;
 *     }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return traversal(nums, 0, nums.length - 1);
    }

    //确定返回值和参数（返回是节点，参数是数组和开始、结束下标）
    public TreeNode traversal(int[] nums, int left, int right) {
        //确定终止条件 采用左闭右闭原则[left, right]
        if (left > right) {
            return null;
        }
        //获取根节点，取中间节点
        int mid = left + ((right - left) / 2); //等同与 (left+right)/2 该写法防止下标越界
        //定义二叉树
        TreeNode root = new TreeNode(nums[mid]);
        //确定单层逻辑
        root.left = traversal(nums, left, mid-1);
        root.right = traversal(nums, mid + 1, right);
        return root;
    }
}

538.把二叉搜索树转换成累加树

力扣链接

题解

Java代码

/**
 * Definition for a binary tree node.
 * 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;
 *     }
 * }
 */
class Solution {
    int prev = 0;
    public TreeNode convertBST(TreeNode root) {
        traversal(root);
        return root;
    }
    //递归遍历 右中左
    //确定返回值和参数（需要遍历整个树，无需返回值；参数是root）
    public void traversal(TreeNode root) {      
        //终止条件
        if (root == null) {
            return;
        }
        //使用反中序遍历。右中左 值进行累加
        convertBST(root.right);
        root.val += prev;
        prev = root.val;
        convertBST(root.left);
    }
}