算法训练Day17 | 110.平衡二叉树、257. 二叉树的所有路径、404.左叶子之和
我新建的个人博客,欢迎访问:hmilzy.github.io
110.平衡二叉树
题目链接:平衡二叉树
用递归!!!
/**
* 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) {
return getHeight(root) != -1;
}
private int getHeight(TreeNode root) {
if (root == null) {
return 0;
}
int leftHeight = getHeight(root.left);
if (leftHeight == -1) {
return -1;
}
int rightHeight = getHeight(root.right);
if (rightHeight == -1) {
return -1;
}
// 左右子树高度差大于1,return -1表示已经不是平衡树了
if (Math.abs(leftHeight - rightHeight) > 1) {
return -1;
}
return Math.max(leftHeight, rightHeight) + 1;
}
}
257. 二叉树的所有路径
题目链接:二叉树的所有路径
递归法牛!!!太需要理解了
/**
* 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> result = new ArrayList<>();
List<Integer> path = new ArrayList<>();
if(root == null) {
return result;
}
traversal(root,path,result);
return result;
}
public static void traversal(TreeNode root,List<Integer> path,List<String> result) {
path.add(root.val);
if(root.left == null && root.right == null) {
StringBuilder sb = new StringBuilder();
for(int i = 0; i < path.size() - 1; i++) {
sb.append(path.get(i)).append("->");
}
sb.append(path.get(path.size() - 1));
result.add(sb.toString());
return ;
}
if(root.left != null) {
traversal(root.left,path,result);
path.remove(path.size() - 1);
}
if(root.right != null) {
traversal(root.right,path,result);
path.remove(path.size() - 1);
}
}
}
404.左叶子之和
题目链接:左叶子之和
/**
* 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 leftValue = sumOfLeftLeaves(root.left);
int rightValue = sumOfLeftLeaves(root.right);
int midValue = 0;
if(root.left != null && root.left.left == null && root.left.right == null) {
midValue = root.left.val;
}
int sum = leftValue + rightValue + midValue;
return sum;
/*
//层序遍历
Deque<TreeNode> deque = new LinkedList<>();
if(root != null){
deque.offer(root);
}
int sum = 0;
while(!deque.isEmpty()){
int size = deque.size();
for(int i = 0;i < size;i++){
TreeNode cur = deque.poll();
if(cur.left != null){
deque.offer(cur.left);
if(cur.left.left == null && cur.left.right == null){
sum += cur.left.val;
}
}
if(cur.right != null){
deque.offer(cur.right);
}
}
}
return sum;
*/
}
}