代码随想录算法训练营第二十三天| 669. 修剪二叉搜索树、108.将有序数组转换为二叉搜索树、538.把二叉搜索树转换为累加树
669. 修剪二叉搜索树
题目链接:669. 修剪二叉搜索树 - 力扣(LeetCode)
思路:
- 当遍历到空时,结束递归
- 当找到一个小于low的节点时,删除此节点和此节点的左子树。由于右子树无法确定,所以需要删除右子树中不在范围内的节点
- 当找到一个大于high的节点时,删除此节点和此节点的右子树,由于左子树无法确定,所以需要删除左子树中不在范围内的节点
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int low, int high) {
if(!root) return nullptr;
if(root->val<low){
TreeNode * right = trimBST(root->right,low,high);
return right;
}else 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;
}
};
108.将有序数组转换为二叉搜索树
题目链接:108. 将有序数组转换为二叉搜索树 - 力扣(LeetCode)
思路:二分 注意区间的划分
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode * FromTree(std::vector<int> &nums,int left,int right){
if(left>right) return nullptr;// 已经遍历完了
int midd = left + ((right-left)>>1);
TreeNode* node = new TreeNode(nums[midd]);
node->left = FromTree(nums,left,midd-1);
node->right = FromTree(nums,midd+1,right);
return node;
}
TreeNode* sortedArrayToBST(std::vector<int>& nums) {
TreeNode * root = FromTree(nums,0,nums.size()-1);
return root;
}
};
538.把二叉搜索树转换为累加树
题目链接:538. 把二叉搜索树转换为累加树 - 力扣(LeetCode)
思路: 因为要按照从大到小的顺序遍历,所以采用 右中左的顺序
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int num = 0;
void changeNode(TreeNode *root){
if(!root) return;
changeNode(root->right);
root->val += num;
num = root->val;
changeNode(root->left);
}
TreeNode* convertBST(TreeNode* root) {// 按照右中左的顺序遍历递归
changeNode(root);
return root;
}
};