一、剪枝
难点在控制单次循环的条件,本题的控制单次循环条件是:遍历节点,如果遇到了不在区间内的点,直接返回新子树。对于新子树,再对它的左右指针进行重新赋值为函数返回值,这就相当于对子树当成新的根节点,当成新树,进行了再修剪操作了。如果根节点不在区间内的话,直接返回了子树的节点充当根节点(left和right)
/**
* 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==nullptr)return nullptr;
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;
}
};
二、二叉搜索树
参照之前切割数组的思路做的,一开始right数组左侧没有+1,也就没有把已经录入根节点的元素去掉,导致出错,改成加一以后就通过了
/**
* 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.size()<1){
return nullptr;
}
int mid=nums.size()/2;
TreeNode*root=new TreeNode(nums[mid]);
vector<int>left(nums.begin(),nums.begin()+mid);
vector<int>right(nums.begin()+mid+1,nums.end());
root->left=sortedArrayToBST(left);
root->right=sortedArrayToBST(right);
return root;
}
};
三、累加树
思路挺好理解的,但是想不到用一个pre来记录上节点的值,对中序遍历的理解没有那么强,这题加强了对中序遍历的理解
/**
* 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 pre=0;
void traversal(TreeNode*cur){
if(cur==nullptr)return;
traversal(cur->right);
cur->val+=pre;
pre=cur->val;
traversal(cur->left);
return;
}
TreeNode* convertBST(TreeNode*root) {
traversal(root);
return root;
}
};