题目1:【二刷完成】
/**
* 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 constructTree(nums,0,nums.length);
}
public TreeNode constructTree(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 maxTreeNodeVal=nums[maxIndex];
for(int i=leftIndex+1;i<rightIndex;i++){
if (nums[i]>maxTreeNodeVal){
maxTreeNodeVal=nums[i];
maxIndex=i;
}
}
TreeNode root = new TreeNode(maxTreeNodeVal);
root.left = constructTree(nums,leftIndex,maxIndex);
root.right = constructTree(nums,maxIndex+1,rightIndex);
return root;
}
}
题目2:【二刷完成】
/**
* 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;
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;
}
}
题目3:【二刷完成】
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);
}
if(root.val<val){
return searchBST(root.right,val);
}
return null;
}
}
题目4:【二刷完成】
/**
* 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 {
// 递归
TreeNode max;
public boolean isValidBST(TreeNode root) {
if (root == null) {
return true;
}
// 左
boolean left = isValidBST(root.left);
if (!left) {
return false;
}
// 中
if (max != null && root.val <= max.val) {
return false;
}
max = root;
// 右
boolean right = isValidBST(root.right);
return right;
}
}