669.修建二叉树
/** * 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; } //如果一开始root的值就不符合范围 //那么就直接从左子树或者右子树开始 if(root.val<low){ TreeNode right = trimBST(root.right,low,high); return right; } if(root.val>high){ TreeNode left = trimBST(root.left,low,high); return left; } //1.根节点符合情况 //2.别忘了,我们的子树是由一个又一个的左右子树构成的 root.left = trimBST(root.left,low,high); root.right = trimBST(root.right,low,high); return root; } }
108.将有序数组转换成二叉搜索树
/** * 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 travelSal(nums,0,nums.length-1); } private TreeNode travelSal(int[] nums,int left,int right){ if(left>right) return null; int mid = (left+right)/2; TreeNode root = new TreeNode(nums[mid]); root.left = travelSal(nums,left,mid-1); root.right = travelSal(nums,mid+1,right); return root; } }
538.把二叉搜索树转换成累加树
/** * 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 sum; public TreeNode convertBST(TreeNode root) { sum = 0; travelSal(root); return root; } private void travelSal(TreeNode cur){ if(cur==null) return ; travelSal(cur.right); sum += cur.val; cur.val = sum; //这里类似于双指针 //Valid travelSal(cur.left); } }