654.最大二叉树
完成
代码
class Solution {
public TreeNode construct(int[] nums, int leftIndex, int rightIndex){
// 没有元素
if(leftIndex+1>rightIndex) return null;
// 只剩一个元素
if(leftIndex+1==rightIndex) return new TreeNode(nums[leftIndex]);
int maxIndex = leftIndex;
int max = nums[leftIndex];
for (int i = leftIndex+1; i < rightIndex; i++) {
if(nums[i]>max){
maxIndex = i;
max = nums[i];
}
}
TreeNode root = new TreeNode(max);
// 递归左子树
root.left = construct(nums, leftIndex, maxIndex);
// 递归右子树
root.right = construct(nums, maxIndex+1, rightIndex);
return root;
}
public TreeNode constructMaximumBinaryTree(int[] nums) {
return construct(nums, 0, nums.length);
}
}
617.合并二叉树
完成
代码
class Solution {
public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
if(root1 == null) return root2;
if(root2 == null) return root1;
// root1和root2均不空
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) return null;
if(val == root.val) return root;
if(root.val > val) return searchBST(root.left, val);
else return searchBST(root.right, val);
}
}
98.验证二叉搜索树
完成
代码
注意不能简单地比较根节点和左右孩子,而是需要比较根节点和其所有的左右孩子。
class Solution {
private long prev = Long.MIN_VALUE;
public boolean isValidBST(TreeNode root) {
if (root == null) {
return true;
}
if (!isValidBST(root.left)) {
return false;
}
if (root.val <= prev) { // 不满足二叉搜索树条件
return false;
}
prev = root.val;
return isValidBST(root.right);
}
}