669、修建二叉搜索树
注意二叉搜索树的特性。当目标节点值小于区间最小值,该节点的左孩子一定不属于区间,但是右孩子需要判断,当目标节点值大于区间最大值,该节点的右孩子一定不属于区间,但是左孩子需要判断。
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;
}
};
class Solution {
public:
TreeNode* traversal(vector<int>& nums, int left, int right) {
if(left > right) return NULL;
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) {
return traversal(nums, 0, nums.size()- 1);
}
};
该题思路就是右中左逆中序遍历二叉树,得到单调递减序列,然后用count记录遍历到的节点值之和,再将count赋值给当前节点值完成题目
class Solution {
public:
int count = 0;
void traversal(TreeNode* root) {
if(root == NULL) return;
traversal(root->right);
int mid = root->val;
root->val += count;
count += mid;
traversal(root->left);
}
TreeNode* convertBST(TreeNode* root) {
traversal(root);
return root;
}
};