DAY21

修剪搜索二叉树

    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.left=trimBST(root.left,low,high);
        root.right=trimBST(root.right,low,high);
        return root;

    }

有序数组转换为二叉平衡搜索树

    public TreeNode buildTree(int[] nums,int start,int end){
        if(start>end)return null;
        int mid=start+(end-start)/2;
        TreeNode t=new TreeNode(nums[mid]);
        t.left=buildTree(nums,start,mid-1);
        t.right=buildTree(nums,mid+1,end);
        return t;

    }
    public TreeNode sortedArrayToBST(int[] nums) {
        return buildTree(nums,0,nums.length-1);
    }

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

    int pre=0;
    public TreeNode convertBST(TreeNode root) {
        travsel(root);
        return root;
    }
    public void travsel(TreeNode t){
        if(t==null)return;
        travsel(t.right);
        t.val=t.val+pre;
        pre=t.val;
        travsel(t.left);
    }

二叉树技巧方面总结：
对于层次遍历，所用队列 Queue q = new LinkedList<>();
存入 q.offer，取出q.poll()
记录二叉树所有路径时，用到回溯方法，回溯终结条件是遇到叶子节点。用List paths = new ArrayList<>();存储路径，回溯时用paths.remove(paths.size() - 1);打印路径时用StringBuilder拼接字符串