669. 修剪二叉搜索树
思路:如果当前节点的值小于val,那么当前节点的左子树也一定小于val,右子树可能有符合范围的节点;同理,如果当前节点的值大于val,那么当前节点的右子树一定也都大于val,左子树可能存在符合范围的节点。
树的删除节点,就是将要删除节点的父结点左子树或者右子树重新指向另一个节点。
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int low, int high) {
if(root == NULL)return NULL;
if(root->val < low){
TreeNode* rightNode = trimBST(root->right, low, high); //因为root的右子树有可能有在范围内的节点
return rightNode;
}
if(root->val > high){
TreeNode* leftNode = trimBST(root->left, low, high);
return leftNode;
}
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){
//左闭右开区间,right取不到,因此当left = right时,就返回NULL
if(left >= right)return NULL;
//保持左闭右开区间
int middle = left + (right -left)/2;//中间节点
TreeNode* root = new TreeNode(nums[middle]);
root->left = traversal(nums, left, middle);
root->right = traversal(nums, middle+1, right);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
if(nums.size() == 0)return NULL;
return traversal(nums, 0, nums.size());
}
};
538.把二叉搜索树转换为累加树
思路:遵循右中左的遍历顺序
class Solution {
public:
int sum = 0; //计算累加值
TreeNode* convertBST(TreeNode* root) {
if(root == NULL)return root;
convertBST(root->right);
root->val += sum; //更新节点的值
sum = root->val;//更新sum的值
convertBST(root->left);
return root;
}
};
迭代法:中序遍历的模板
class Solution {
public:
int sum = 0;
TreeNode* convertBST(TreeNode* root) {
if(root == NULL)return root;
stack<TreeNode*>st;
TreeNode* cur = root;
while(cur != NULL || !st.empty()){
//先遍历到最右边的节点
if(cur != NULL){
st.push(cur);
cur = cur->right; //右
}else{
cur = st.top();
st.pop();
cur->val += sum; //更新节点的值
sum = cur->val; //更新sum值
cur = cur->left; //左
}
}
return root;
}
};