LeetCode 669 修剪二叉搜索树
题目链接:669
思路:若当前节点在给定区间内,则当前节点不用处理,直接递归处理左右子树;若当前节点大于high
,则说明该节点的右子树所有元素都大于high
,因此可直接放弃右子树,对左子树递归修剪,并返回左孩子给上层;当前节点小于low
同理。
代码:
/**
* 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 NULL;
if (root->val > high) {
root->left = trimBST(root->left, low, high);
return root->left;
}
if (root->val < low) {
root->right = trimBST(root->right, low, high);
return root->right;
}
root->left = trimBST(root->left, low, high);
root->right = trimBST(root->right, low, high);
return root;
}
};
LeetCode 108 将有序数组转换为二叉搜索树
题目链接:108
思路:升序数组即为一个二叉搜索树的中序遍历,为构造平衡搜索树,可选中间节点作为根节点,再通过左侧数组和右侧数组分别构造左子树和右子树。
代码:
/**
* 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* sortedArrayToBST(vector<int>& nums) {
if (nums.empty()) return NULL;
int mid_idx = nums.size() / 2;
TreeNode* new_node = new TreeNode(nums[mid_idx]);
vector<int> left(nums.begin(), nums.begin()+mid_idx);
vector<int> right(nums.begin()+mid_idx+1, nums.end());
new_node->left = sortedArrayToBST(left);
new_node->right = sortedArrayToBST(right);
return new_node;
}
};
LeetCode 538 把二叉搜索树转换为累加树
题目链接:538
思路:按右中左顺序遍历可得降序数组,则每个节点的值都为之前节点累加+当前节点的值。
代码:
/**
* 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 sum = 0;
TreeNode* convertBST(TreeNode* root) {
if (!root) return NULL;
root->right = convertBST(root->right);
sum += root->val;
root->val = sum;
root->left = convertBST(root->left);
return root;
}
};