1.修剪二叉搜索树
思路:
1.本题并不是单纯地删除一个结点。需要重建二叉树。
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int low, int high) {
if(root == NULL) return NULL;
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;
}
root -> left = trimBST(root -> left,low,high);
root -> right = trimBST(root -> right,low,high);
return root;
}
};
2.将有序数组转换为平衡二叉搜索树
https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/
思路:
1.如果根据数组构造一棵二叉树。本质就是寻找分割点,分割点作为当前节点,然后递归左区间和右区间。
2.分割点就是数组中间位置的节点。
3.构造二叉树的时候,一定要确定好分割区间的规则。左闭右闭!
4.利用数组:
class Solution {
public:
TreeNode* traversal(vector<int>& nums){
if(nums.size() == 0) return NULL;
int mid = (0 + (nums.size() - 1 - 0))/2;
TreeNode* node = new TreeNode(nums[mid]);
if(nums.size() == 1) return node;
vector<int> left(nums.begin(), nums.begin() + mid);
vector<int> right(nums.begin() + mid + 1, nums.end());
node -> left = traversal(left);
node -> right = traversal(right);
return node;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return traversal(nums);
}
};
5.利用下标:
class Solution {
public:
TreeNode* traversal(vector<int>& nums,int left,int right){
if(nums.size() == 0) return NULL;
if(left > right) return NULL;
int mid = left + ((right - left)/2);
TreeNode* node = new TreeNode(nums[mid]);
node -> left = traversal(nums, left,mid - 1);// right 不能写为left+mid-1
node -> right = traversal(nums, mid + 1, right);
return node;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = traversal(nums,0,nums.size() - 1);
return root;
}
};
3.把二叉搜索树转换为累加树
https://leetcode.cn/problems/convert-bst-to-greater-tree/
思路:
1.从树中可以看出累加的顺序是右中左,所以我们需要反中序遍历这个二叉树,然后顺序累加就可以了。
2.累加顺序:右中左。(从大到小地去遍历整棵树)
3.双指针法。
class Solution {
public:
TreeNode* pre = NULL;
TreeNode* convertBST(TreeNode* root) {
if(root == NULL) return NULL;
root -> right = convertBST(root -> right);
if(pre != NULL){
root -> val += pre ->val;
}
pre = root;
root -> left = convertBST(root -> left);
return root;
}
};