算法Day15 | Leetcode654.最大二叉树、617.合并二叉树、700.二叉搜索树中的搜索、98.验证二叉搜索树

654.最大二叉树

力扣链接

思路

前序遍历，找到数组中的最大值，记录划分左右子树的起始下标和终止下标，坚持左闭右开

代码

/**
 * 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 constructMaximumBinaryTree(int[] nums) {
        return createTreeNode(nums,0,nums.length);
    }

    public TreeNode createTreeNode(int[] nums,int begin,int end){
        if(begin>=end) return null;
        int max=-1;
        int maxIndex=-1;
        for(int i=begin;i<end;i++){
            if(nums[i]>max){
                max=nums[i];
                maxIndex=i;
            }
        }
        TreeNode root=new TreeNode(max);
        TreeNode leftNode=createTreeNode(nums,begin,maxIndex);
        TreeNode rightNode=createTreeNode(nums,maxIndex+1,end);
        root.left=leftNode;
        root.right=rightNode;
        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) {
        if(root1==null) return root2;   //如果root2也是null，那就本来就要返回null，没区别
        if(root2==null) return root1;
        TreeNode root=new TreeNode(root1.val+root2.val);
        TreeNode leftNode=mergeTrees(root1.left,root2.left);
        TreeNode rightNode=mergeTrees(root1.right,root2.right);
        root.left=leftNode;
        root.right=rightNode;
        return root;
    }
}

700.二叉搜索树中的搜索

力扣链接

思路

判断是否符合条件，以及往左还是往右遍历

代码

/**
 * 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 searchBST(TreeNode root, int val) {
        if(root==null) return root;
        if(root.val==val) return root;
        if(root.val>val) return searchBST(root.left,val);
        else return searchBST(root.right,val);
    }
}

98.验证二叉搜索树

力扣链接

思路

中序遍历，把遍历结果写下来可以发现它是递增的。记录前一个的节点，判断是否大于前一个节点

代码

/**
 * 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;
 *     }
 * }
 */
 //用中序遍历这个数组（左中右），这个二叉树是单调递增的（123-true、15346-false），在中的位置（两两比较，如果在后序就少了一个元素比较）
class Solution {
    TreeNode maxRecord;     //这里不能写TreeNode maxRecord=new TreeNode()，会被初始化成[0]，而当输入为[0]的时候就会变成false，但应该是true
    public boolean isValidBST(TreeNode root) {
        if(root==null) return true;
        boolean leftResult=isValidBST(root.left);
        if(!leftResult) return false;
        if(maxRecord!=null && root.val<=maxRecord.val) return false;     //maxRecord是上一个节点
        maxRecord=root;
        return isValidBST(root.right);
    }
}