669. 修剪二叉搜索树
思路: 遍历二叉树,判断是否在**[low,high]**内,若是超出范围,要继续遍历此节点的左右孩子,不能直接删除节点。
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;
}
};
108.将有序数组转换为二叉搜索树
思路: 有序数组,转化为二叉搜索树,可以直接寻找数组的中值,然后切分数组,左半作为左子树,右半作为右子树。再进行递归的调用左数组和右数组。
class Solution {
public:
TreeNode* traversal(vector<int>& nums, int left, int right) {
if (left > right)
return nullptr;
int mid = left + ((right - left) / 2);
TreeNode* root = new TreeNode(nums[mid]);
root->left = traversal(nums, left, mid - 1);
root->right = traversal(nums, mid + 1, right);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = traversal(nums, 0, nums.size() - 1);
return root;
}
};
538.把二叉搜索树转换为累加树
思路: 本体相当于一个有序数组,从后往前累加,因此可以使用反向中序遍历,进行右中左遍历,将它累加入结果。
class Solution {
public:
int pre = 0; // 记录前一个节点的数值
void traversal(TreeNode* cur) { // 右中左遍历
if (cur == NULL) return;
traversal(cur->right);
cur->val += pre;
pre = cur->val;
traversal(cur->left);
}
TreeNode* convertBST(TreeNode* root) {
pre = 0;
traversal(root);
return root;
}
};