代码随想录算法训练营第二十三天-二叉树9 ｜669. 修剪二叉搜索树 108.将有序数组转换为二叉搜索树 538.把二叉搜索树转换为累加树

m0_65482476

已于 2022-11-25 08:31:10 修改

阅读量110

点赞数

文章标签：算法数据结构

于 2022-11-25 08:28:17 首次发布

本文链接：https://blog.csdn.net/m0_65482476/article/details/128030101

版权

669. 修剪二叉搜索树

public class TrimaBinarySearchTree {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        if(root == null) return null;

        //要删的节点
        if(root.val < low){
            return trimBST(root.right, low, high);
        }
        if(root.val > high){
            return trimBST(root.left, low, high);
        }
        // root在[low,high]范围内
        root.left = trimBST(root.left, low, high);
        root.right = trimBST(root.right, low, high);
        return root;

    }
}

108.将有序数组转换为二叉搜索树

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

public class ConvertSortedArraytoBinarySearchTree {
    public TreeNode sortedArrayToBST(int[] nums) {
        TreeNode root = traversal(nums, 0, nums.length - 1);
        return root;

    }
    // 左闭右闭区间[left, right)
    private TreeNode traversal(int[] nums, int left, int right){
        if(left > right) return null;

        int mid = (right + left) /2; //数组里下标相加不会爆内存，所以可以这样用
        TreeNode root = new TreeNode(nums[mid]);
        root.left = traversal(nums, left, mid - 1);
        root.right = traversal(nums, mid + 1, right);
        return root;

    }
}

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

public class ConvertBSTtoGreatertTree {
    //递归
    //二叉搜素数是左中右，从小到大，那么从大到小就是右中左
    int pre;
    public TreeNode convertBST(TreeNode root){
        pre = 0;
        convertBST1(root);
        return root;
    }
    // 按右中左顺序遍历，累加即可
    public void convertBST1(TreeNode root){
        if(root == null) return;
        //左
        convertBST1(root.right);
        //中
        root.val += pre;
        pre = root.val;
        //右
        convertBST1(root.left);
    }
}