创造营第十七天 | ● 110.平衡二叉树 ● 257. 二叉树的所有路径 ● 404.左叶子之和

 110.平衡二叉树 （优先掌握递归）

题目链接/文章讲解/视频讲解：代码随想录

class Solution {
    //二叉树的每个节点的左右子树高度差绝对值不超过1
    public boolean isBalanced(TreeNode root) {
        return getHeight(root) != -1;
    }
    public 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;
        if(Math.abs(leftHeight - rightHeight) > 1) return -1;
        else return 1 + Math.max(leftHeight, rightHeight);
    }
}

 257. 二叉树的所有路径 （优先掌握递归）  

题目链接/文章讲解/视频讲解：代码随想录

这题思路顺下来了但是又记不住 重要的是对叶子结点的处理以及递归回溯的结合

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();//接收最终结果
        if(root == null) return res;
        List<Integer> paths = new ArrayList<>();//接收路径
        traversal(root, paths, res);
        return res;
    }
    public 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();//拼接路径
            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);
        }
    }
}

 404.左叶子之和 （优先掌握递归）

题目链接/文章讲解/视频讲解：代码随想录

判断左叶子从其父结点开始 

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        int leftNum = sumOfLeftLeaves(root.left);//左
        int rightNum = sumOfLeftLeaves(root.right);//右
        int midNum = 0;
        if(root.left != null && root.left.left == null && root.left.right == null) {
            midNum = root.left.val;
        }
        return midNum + leftNum + rightNum; //中
    }
}