110.平衡二叉树
leetcode链接:110.平衡二叉树
题目:
给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:true
示例 2:
输入:root = [1,2,2,3,3,null,null,4,4]
输出:false
示例 3:
输入:root = []
输出:true
Java代码
/**
* 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 boolean isBalanced(TreeNode root) {
if(root == null) {
return true;
}
if(Math.abs(getMaxDepth(root.left) - getMaxDepth(root.right)) > 1) {
return false;
}
return isBalanced(root.left) && isBalanced(root.right);
}
public int getMaxDepth(TreeNode root) {
if(root == null) {
return 0;
}
return Math.max(getMaxDepth(root.left),getMaxDepth(root.right)) + 1;
}
}
257.二叉树的所有路径
leetcote链接:257.二叉树的所有路径
题目:给你一个二叉树的根节点 root
,按 任意顺序 ,返回所有从根节点到叶子节点的路径。
叶子节点 是指没有子节点的节点。
示例 1:
输入:root = [1,2,3,null,5]
输出:[“1->2->5”,“1->3”]
示例 2:
输入:root = [1]
输出:[“1”]
Java代码
/**
* 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 List<String> binaryTreePaths(TreeNode root) {
List<String> list = new ArrayList<String>();
StringBuffer sb = new StringBuffer();
if(root == null) {
return list;
}
return Paths(root,list,sb);
}
public List<String> Paths(TreeNode root,List<String> list,StringBuffer sb) {
sb.append(root.val + "->");
if(root.left == null && root.right == null) {
sb.delete(sb.length()-2,sb.length());
list.add(sb.toString());
return list;
}
if(root.left != null){
Paths(root.left,list,sb);
sb.delete(sb.lastIndexOf("" + root.left.val),sb.length());
}
if(root.right != null) {
Paths(root.right, list, sb);
sb.delete(sb.lastIndexOf("" + root.right.val),sb.length());
}
return list;
}
}
404.左子叶之和
leetcode链接:404.左子叶之和
题目:给定二叉树的根节点 root
,返回所有左叶子之和。
示例 1:
输入: root = [3,9,20,null,null,15,7]
输出: 24
解释: 在这个二叉树中,有两个左叶子,分别是 9 和 15,所以返回 24
示例 2:
输入: root = [1]
输出: 0
Java代码
/**
* 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(root == null) {
return 0;
}
int sum = 0;
if(root.left != null && root.left.left == null && root.left.right == null) {
sum += root.left.val;
}
sum = sum + sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
return sum;
}
}