1.判断平衡二叉树
class Solution {
public boolean isBalanced(TreeNode root) {
int flag = getHeight(root);
if (flag == -1) return false;
else return true;
}
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;
}
}
2.求二叉树的所有路径
class Solution {
public List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();// 最终的结果为String类型
if (root == null) {
return res;
}
List<Integer> paths = new ArrayList<>();// 结果中的路径,使用Integer
traversal(root, paths, res);
return res;
}
private void traversal(TreeNode root, List<Integer> paths, List<String> res) {
paths.add(root.val);// 前序遍历,中
// 遇到叶子结点
if (root.left == null && root.right == null) {
// 输出
StringBuilder sb = new StringBuilder();// 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) { // 左
traversal(root.left, paths, res);
paths.remove(paths.size() - 1);// 回溯
}
if (root.right != null) { // 右
traversal(root.right, paths, res);
paths.remove(paths.size() - 1);// 回溯
}
}
}
3.求所有左叶子节点的值
class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if(root==null){
return 0;
}
int midValue = 0;
if(root.left!=null && root.left.left==null && root.left.right==null){
midValue = root.left.val;
}
int sum = sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right) + midValue;
return sum;
}
}