669. 修剪二叉搜索树
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:你修剪的方式不对,我来给你纠正一下!| LeetCode:669. 修剪二叉搜索树_哔哩哔哩_bilibili
状态:未通过
递归法代码实现:
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.将有序数组转换为二叉搜索树
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:构造平衡二叉搜索树!| LeetCode:108.将有序数组转换为二叉搜索树_哔哩哔哩_bilibili
状态:通过
代码实现:
class Solution {
private:
TreeNode* traversal(vector<int>& nums, int left, int right){
if(right - left <= 0) return NULL;
if(right - left == 1){
TreeNode* node = new TreeNode(nums[left]);
return node;
}
int mid = left + (right - left) / 2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = traversal(nums, left, mid);
root->right = traversal(nums, mid + 1, right);
return root;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
if(nums.size() == 0) return NULL;
TreeNode* root = traversal(nums, 0, nums.size());
return root;
}
};
538.把二叉搜索树转换为累加树
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:普大喜奔!二叉树章节已全部更完啦!| LeetCode:538.把二叉搜索树转换为累加树_哔哩哔哩_bilibili
状态:通过
代码实现:
class Solution {
private:
TreeNode* pre = NULL;
void traversal(TreeNode* cur){
if(cur == NULL) return;
traversal(cur->right);
if(pre != NULL) cur->val += pre->val;
pre = cur;
traversal(cur->left);
};
public:
TreeNode* convertBST(TreeNode* root) {
traversal(root);
return root;
}
};