修剪二叉树
题目链接:
首先判断当前节点是否为空,若为空则返回null;然后判断当前节点的值是否小于low或大于high,分别对应着需要删除左子树或右子树的节点;最后更新当前节点的左子树和右子树,并返回修剪后的当前节点
代码:
/**
* 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 trimBST(TreeNode root, int low, int high) {
if (root == null) {
return null;
}
if (root.val < low) {
return trimBST(root.right, low, high);
}
if (root.val > high) {
return trimBST(root.left, low, high);
}
// root在[low,high]范围内
root.left = trimBST(root.left, low, high);
root.right = trimBST(root.right, low, high);
return root;
}
}
将有序数组转换为二叉搜索树
题目链接
108. 将有序数组转换为二叉搜索树 - 力扣(LeetCode)
思路:
利用二叉搜索树的特性,选数组中间位置为当前节点,然后继续向左向右递归
代码:
/**
* 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 f(int[] nums,int left,int right){
if(left>right){
return null;
}
int mid=left+(right-left)/2;
TreeNode root=new TreeNode(nums[mid]);
root.left=f(nums,left,mid-1);
root.right=f(nums,mid+1,right);
return root;
}
public TreeNode sortedArrayToBST(int[] nums) {
TreeNode node = f(nums, 0, nums.length - 1);
return node;
}
}
把二叉搜索树转换为累加树
题目链接:
538. 把二叉搜索树转换为累加树 - 力扣(LeetCode)
思路:
对二叉树进行反中序遍历,对节点数值进行累加
首先,它定义了一个变量pre,用于保存路径上的节点值之和。
如果当前节点为null,表示遍历到叶子节点的子节点,直接返回。
递归调用f函数处理右子树。
更新pre值为当前节点值与pre的和。
将当前节点值更新为pre。
递归调用f函数处理左子树。
代码:
/**
* 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 int sum;
public void f(TreeNode root) {
if (root == null) {
return;
}
f(root.right);
sum += root.val;
root.val = sum;
f(root.left);
}
public TreeNode convertBST(TreeNode root) {
sum=0;
f(root);
return root;
}
}