669. 修剪二叉搜索树
一开始考虑了很多细节情况,实在考虑不周到了,看了讲解。发现自己还是对返回Treenode的情况有时候想不明白,容易绕进去
class Solution {
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;
}
}
108.将有序数组转换为二叉搜索树
这个题做过很多遍了,真是爱考啊
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return sortedArrayToBST(nums, 0, nums.length);
}
public TreeNode sortedArrayToBST(int[] nums, int left, int right) {
if(left-right>=0) return null;
if(right-left==1) return new TreeNode(nums[left]);
int mid = left + (right - left) / 2;
TreeNode root=new TreeNode(nums[mid]);
root.left=sortedArrayToBST(nums,left,mid);
root.right=sortedArrayToBST(nums,mid+1,right);
return root;
}
}
538.把二叉搜索树转换为累加树
class Solution {
int sum;
public TreeNode convertBST(TreeNode root) {
sum = 0;
convertBST1(root);
return root;
}
public void convertBST1(TreeNode root){
if(root==null) return;
convertBST1(root.right);
sum+=root.val;
root.val=sum;
convertBST1(root.left);
}
}