代码随想录第二十天: 二叉树part06

力扣654 最大二叉树

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        TreeNode root = new TreeNode();
        root = maxBit(nums, 0, nums.length - 1);
        return root;
    }

    public TreeNode maxBit(int[] nums, int leftIndex, int rightIndex) {
        if(leftIndex > rightIndex) return null;
        if(leftIndex == rightIndex) {
            TreeNode node = new TreeNode();
            node.val = nums[leftIndex];
            return node;
        }
        int maxIndex = leftIndex;
        int maxValue = nums[leftIndex];
        for(int i = leftIndex; i <= rightIndex; i++) {
            if(nums[i] > maxValue) {
                maxValue = nums[i];
                maxIndex = i;
            }
        }
        TreeNode root = new TreeNode();
        root.val = maxValue;
        root.left = maxBit(nums, leftIndex, maxIndex - 1);
        root.right = maxBit(nums, maxIndex + 1, rightIndex);
        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) return null;
        if(root.val == val) return root;
        if(root.val < val) return searchBST(root.right, val);
        return searchBST(root.left, val);
    }
}

力扣98 验证二叉搜索树

class Solution {
    public List<Integer> inorderArray = new LinkedList<>();

    public boolean isValidBST(TreeNode root) {
        inorder(root);
        int compare = inorderArray.get(0);
        for(int i = 1; i < inorderArray.size(); i++) {
            if(inorderArray.get(i) <= compare) return false;
            compare = inorderArray.get(i);
        }
        return true;
    }

    public void inorder(TreeNode root) {
        if(root.left != null) inorder(root.left);
        if(root != null) inorderArray.add(root.val);
        if(root.right != null) inorder(root.right);
    }
}