代码随想录算法训练营第二十天

二叉树相关

654.最大二叉树

参考文章
题目链接

个人题解

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return traversal(nums, 0, nums.length);
    }

    private TreeNode traversal(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 maxValue = nums[maxIndex];
        for (int i = leftIndex + 1; i < rightIndex; i++) {
            if (nums[i] > maxValue) {
                maxValue = nums[i];
                maxIndex = i;
            }
        }

        TreeNode root = new TreeNode(maxValue);
        root.left = traversal(nums, leftIndex, maxIndex);
        root.right = traversal(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;
          }
          if (root.val > val) {
              return searchBST(root.left, val);
          }else {
              return searchBST(root.right, val);
          }
      }
  }

98.验证二叉搜索树

参考文章
题目链接

个人题解

class Solution {
    private long preValue = Long.MIN_VALUE;

    public boolean isValidBST(TreeNode root) {
        if (root == null) {
            return true;
        }
        if (!isValidBST(root.left)) {
            return false;
        }
        if (root.val <= preValue) {
            return false;
        }
        preValue = root.val;
        return isValidBST(root.right);
    }
}