创造营第二十天 | 654.最大二叉树 ● 617.合并二叉树 ● 700.二叉搜索树中的搜索 ● 98.验证二叉搜索树

654.最大二叉树 

题目链接/文章讲解：代码随想录

考虑叶子结点

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return getConstructMaximumBinaryTree(nums, 0, nums.length);
    }
    public TreeNode getConstructMaximumBinaryTree(int[] nums, int leftIndex, int rightIndex) {
        //左闭右开区间
        if(rightIndex - leftIndex < 1) return null;//无元素
        if((rightIndex - leftIndex == 1)) return new TreeNode(nums[leftIndex]);//一个元素
        int maxIndex = leftIndex;
        int maxval= nums[leftIndex];
        for(int i = maxIndex + 1; i < rightIndex; i++) {
            if(nums[i] > maxval) {
                maxIndex = i;
                maxval = nums[i];
            }
        }
        TreeNode root = new TreeNode(maxval);
        root.left = getConstructMaximumBinaryTree(nums, leftIndex, maxIndex);
        root.right = getConstructMaximumBinaryTree(nums, maxIndex + 1, rightIndex);
        return root;
    }
}

没有单独考虑叶子结点，会进入递归，遇到第一条if判断语句返回

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return getConstructMaximumBinaryTree(nums, 0, nums.length);
    }
    public TreeNode getConstructMaximumBinaryTree(int[] nums, int leftIndex, int rightIndex) {
        //左闭右开区间
        if(rightIndex - leftIndex < 1) return null;//无元素
        //if((rightIndex - leftIndex == 1)) return new TreeNode(nums[leftIndex]);//一个元素
        int maxIndex = leftIndex;
        int maxval= nums[leftIndex];
        if((rightIndex - leftIndex > 1)){
            for(int i = maxIndex + 1; i < rightIndex; i++) {
                if(nums[i] > maxval) {
                    maxIndex = i;
                    maxval = nums[i];
                }
            }
        }
        
        TreeNode root = new TreeNode(maxval);
        root.left = getConstructMaximumBinaryTree(nums, leftIndex, maxIndex);
        root.right = getConstructMaximumBinaryTree(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 || root.val == val) return root;
        TreeNode result = null;
        if(val > root.val) result = searchBST(root.right, val);
        if(val < root.val) result = searchBST(root.left, val);
        return result;
    }
}

迭代

注意while循环里条件是并集

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

 98.验证二叉搜索树 

题目链接/文章讲解：代码随想录

双指针比较前一个结点和当前结点的值大小，中序遍历 前一个值必然小于后一个值

class Solution {
    TreeNode pre = null;
    public boolean isValidBST(TreeNode root) {
        
        if(root == null) return true;//注意true
        boolean left = isValidBST(root.left);//左
        if(pre != null && root.val <= pre.val) return false;//中
        pre = root;
        boolean right = isValidBST(root.right);//右
        return left && right;
    }
}