class Solution {
public TreeNode trimBST(TreeNode root, int low, int high) {
if(root == null) return root;
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;
}
}
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return sortedArrayToBST1(nums, 0, nums.length-1);
}
public TreeNode sortedArrayToBST1(int[] nums, int left, int right){
if(left > right){
return null;
}
int mid = left + ((right - left)>>1);
TreeNode root = new TreeNode(nums[mid]);
root.left = sortedArrayToBST1(nums, left, mid - 1);
root.right = sortedArrayToBST1(nums, mid + 1, right);
return root;
}
}
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);
}
}