代码随想录day17：二叉树part6，合并二叉树，二叉搜索树

day17：二叉树part6，合并二叉树，二叉搜索树

654.最大二叉树

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return construct(nums, 0, nums.length);
    }

    public TreeNode construct(int[] nums, int left, int right) {
        if (left >= right) return null;
        if (right - left == 1) return new TreeNode(nums[left]);
        int maxIndex = left;
        int maxValue = nums[left];
        for (int i = left; i < right; i++) {
            if (nums[i] > maxValue) {
                maxValue = nums[i];
                maxIndex = i;
            }
        }
        TreeNode root = new TreeNode(nums[maxIndex]);
        root.left = construct(nums, left, maxIndex);
        root.right = construct(nums, maxIndex + 1, right);
        return root;
    }
}

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;
        if (val < root.val) return searchBST(root.left, val);
        else return searchBST(root.right, val);
    }
}

98.验证二叉搜索树

class Solution {
    TreeNode pre = null;
    public boolean isValidBST(TreeNode root) {
        // 可以有空的二叉搜索树
        if (root == null) return true;
        // 按中序遍历判断大小
        // 左
        if (!isValidBST(root.left)) return false;
        // 中
        if (pre != null && pre.val >= root.val) return false;
        pre = root;
        // 右
        return isValidBST(root.right);
    }
}