LeetCode110 平衡二叉树
* 二叉树的左右高度相差不超过1即可
package algor.trainingcamp;
import algor.junior_algor.tree.TreeNode;
/**
* @author lizhe
* @version 1.0
* @description:
*
* 给定一个二叉树,判断它是否是高度平衡的二叉树。
* 本题中,一棵高度平衡二叉树定义为:
* 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
* @date 2023/4/21 07:58
*
* 判断左右两个子树的高度差绝对值即可
*/
public class LeetCode110 {
public boolean isBalanced(TreeNode root) {
if(root == null){
return true;
}
return getDepth(root) >= 0;
}
public int getDepth(TreeNode root){
if(null == root){
return 0;
}
int leftH = getDepth(root.left);
int rightH = getDepth(root.right);
if(leftH >= 0 && rightH >= 0 && Math.abs(leftH - rightH) <= 1){
return Math.max(leftH, rightH) + 1;
}else{
return -1;
}
}
}
LeetCode 257
* 递归举出二叉树的所有路径
package algor.trainingcamp;
import algor.junior_algor.tree.TreeNode;
import java.util.ArrayList;
import java.util.List;
/**
* @author lizhe
* @version 1.0
* @description: 257. 二叉树的所有路径
*
* 给你一个二叉树的根节点 root ,按 任意顺序 ,返回所有从根节点到叶子节点的路径。
*
* 叶子节点 是指没有子节点的节点。
* @date 2023/4/21 08:09
*/
public class LeetCode257 {
public List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();
if(null == root){
return res;
}
List<Integer> paths = new ArrayList<>();
helper(root, paths, res);
return res;
}
/**
* path: 单次结果路径
* res: 返回值
*/
public void helper(TreeNode root, List<Integer> paths, List<String> res){
paths.add(root.val);
//找到了叶子节点
if(root.left == null && root.right == null){
StringBuilder sb = new StringBuilder();
for(int i = 0;i < paths.size() - 1;i++){
sb.append(paths.get(i)).append("->");
}
sb.append(paths.get(paths.size() - 1));
res.add(sb.toString());
return;
}
if(root.left != null){
helper(root.left, paths, res);
paths.remove(paths.size() - 1);
}
if(root.right != null){
helper(root.right, paths, res);
paths.remove(paths.size() - 1);
}
}
}
LeetCode404 计算所有左节点的和
/**
* 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 sumOfLeftLeaves(TreeNode root) {
if(null == root){
return 0;
}
int sum = 0;
if(root.left != null && root.left.left == null && root.left.right == null){
sum += root.left.val;
}
int leftVal = sumOfLeftLeaves(root.left);
int rightVal = sumOfLeftLeaves(root.right);
return leftVal + rightVal + sum;
}
}