代码随想录第23天|二叉树

669. 修剪二叉搜索树

在一个函数中可以同时向两边处理
递归最重要的是把子树也看作一个待解决的过程

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int low, int high) {
        if (root == nullptr) return nullptr;

        //不在区间范围内的处理
        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.将有序数组转换为二叉搜索树

思路:
把数组中点作为根节点
当数组为偶数时, 取靠左的节点

class Solution {
public:
    TreeNode* myoperator(vector<int>& nums, int left, int right) {
        if (left > right) return nullptr;

        int mid = (left + right) / 2;
        TreeNode* tem = new TreeNode(nums[mid]);

        tem->left = myoperator(nums, left, mid - 1);	//对左子树进行构造
        tem->right = myoperator(nums, mid + 1, right);	//对右子树进行构造
        return tem;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return myoperator(nums, 0, nums.size() - 1);
    }
};

---

538.把二叉搜索树转换为累加树

思路:
类比于数组的操作, 双指针法
遍历顺序: 右 中 左

class Solution {
public:
    int pre_val = 0;
    void myoperator(TreeNode* cur) {
        if (cur == nullptr) return;

        myoperator(cur->right);

        cur->val += pre_val;
        pre_val = cur->val;

        myoperator(cur->left);
    }
    TreeNode* convertBST(TreeNode* root) {
        myoperator(root);
        return root;
    }
};