代码随想录day20

第9天

前言

654. 最大二叉树

思路：
前序遍历，先找到下标，然后前序遍历构建二叉树

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return findNode(nums,0,nums.length);
   }
    public int findMaxNode(int[] nums,int left,int right){
        int index = -1;
        int val = -1;
        for(int i = left; i < right;i ++){
            if(nums[i] > val){
                val = nums[i];
                index = i;
            }
        }
        return index;
    }
    public TreeNode findNode(int[] nums,int left,int right){
        
        if(right - left < 1) return null;
        if(right - left == 1){
            return new TreeNode(nums[left]);
        }

        int rootIndex = findMaxNode(nums,left,right);
        TreeNode root = new TreeNode(nums[rootIndex]);

        root.left = findNode(nums,left,rootIndex);
        root.right = findNode(nums,rootIndex + 1, right);
        return root;
       
    }
}

617合并二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        TreeNode root;
        if(root1 == null && root2 == null) return null;
        if(root1 == null){
            return root2;
        }
        if(root2 == null){
            return root1;
        }
        root = new TreeNode(root1.val + root2.val);
        root.left = mergeTrees(root1.left,root2.left);
        root.right = mergeTrees(root1.right,root2.right);
        return root;

    }
}

700. 二叉搜索树中的搜索

class Solution {
    // 左 中 右二叉搜索树是中序遍历 他是一个递增序列
    public TreeNode searchBST(TreeNode root, int val) {
        if(root == null) return null;
        
        if(root.val == val){
            return root;
        }else if(root.val > 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;
        }
        boolean left =  isValidBST(root.left);
        if(pre!= null && pre.val >= root.val) return false;
        pre = root;
        boolean right = isValidBST(root.right);
        return left && right;
    }
}