Day 17

654. 最大二叉树

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        TreeNode* node = new TreeNode(0);
        if (nums.size() == 1) {
            node->val = nums[0];
            return node;
        }
        // 构建二叉树都使用前序遍历
        // 中
        int Maxvalue = 0;
        int index = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] > Maxvalue) {
                Maxvalue = nums[i];
                index = i;
            }
        }
        node->val = Maxvalue;
        // 左
        if (index > 0) {
            vector<int> newVec(nums.begin(), nums.begin() + index);
            node->left = constructMaximumBinaryTree(newVec);
        }
        // 右
        if (index < nums.size() - 1) {
            vector<int> newVec(nums.begin() + index + 1, nums.end());
            node->right = constructMaximumBinaryTree(newVec);
        }
        return node;
    }
};

优化版本:

class Solution {
private:
    // 在左闭右开区间[left, right)，构造二叉树
    TreeNode* traversal(vector<int>& nums, int left, int right) {
        if (left >= right) return nullptr;

        // 分割点下标：maxValueIndex
        int maxValueIndex = left;
        for (int i = left + 1; i < right; ++i) {
            if (nums[i] > nums[maxValueIndex]) maxValueIndex = i;
        }

        TreeNode* root = new TreeNode(nums[maxValueIndex]);

        // 左闭右开：[left, maxValueIndex)
        root->left = traversal(nums, left, maxValueIndex);

        // 左闭右开：[maxValueIndex + 1, right)
        root->right = traversal(nums, maxValueIndex + 1, right);

        return root;
    }
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return traversal(nums, 0, nums.size());
    }
};

617. 合并二叉树

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if (root1 == NULL) return root2;
        if (root2 == NULL) return root1;
        // 中
        root1->val += root2->val;
        // 左
        root1->left = mergeTrees(root1->left, root2->left);
        // 右
        root1->right = mergeTrees(root1->right, root2->right);
        return root1;
    }
};

700. 二叉搜索树中的搜索

递归:

class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        // 终止条件
        if(root == NULL || root->val == val) return root;
        // 单层递归逻辑
        TreeNode* result=NULL;
        if (root->val > val) result = searchBST(root->left, val);
        if (root->val < val) result = searchBST(root->right, val);
        return result; 
    }
};

迭代:

class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        while(root != NULL) {
            if (root->val > val) root = root->left;
            else if (root->val < val) root = root->right; 
            else return root;
        }
        return NULL;
    }
};

 98. 验证二叉搜索树

class Solution {
public:
    long long maxVal = LONG_MIN;
    bool isValidBST(TreeNode* root) {
        if (root == NULL) return true;
        bool left = isValidBST(root->left);
        if (root->val > maxVal) {
            maxVal = root->val;
        } else return false;
        bool right = isValidBST(root->right);
        return left && right;
    }
};