day 20 654.最大二叉树 617.合并二叉树 700.二叉搜索树中的搜索 98.验证二叉搜索树

654.最大二叉树

链接：力扣     代码随想录

代码：

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return builds(nums, 0, nums.length - 1);

    }
    TreeNode build(int[] nums, int lo, int hi){
        if(lo > hi){
            return null;
        }
        int index = -1, maxVal = Integer.MIN_VALUE;
        for( int i = lo; i <= hi; i++){
            if(maxVal < nums[i]){
                index = i;
                maxVal = num[i];
            }
        }
        TreeNode root = new TreeNode(maxVal);
        root.left = build(nums, lo, index - 1);
        root.right = build(nums, index + 1; hi);
        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, roo2.right);
        return root1;

    }
}

700.二叉搜索树中的搜索

链接：力扣       代码随想录

代码：

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

    }
}

98.验证二叉搜索树

链接：力扣     代码随想录

代码：

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