代码随想录算法训练营第十五天| LeetCode 110，257，404

目录

LeetCode 101.平衡二叉树 

LeetCode 257.二叉树的所有路径

LeetCode 404.左叶子之和

---

LeetCode 101.平衡二叉树 

文章讲解：代码随想录

视频讲解：后序遍历求高度，高度判断是否平衡 | LeetCode：110.平衡二叉树_哔哩哔哩_bilibili

力扣题目：LeetCode 110. 平衡二叉树

 

 代码如下（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) {

        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;

        if(Math.abs(leftHeight - rightHeight) > 1)  return -1;

        return Math.max(leftHeight, rightHeight) + 1;
    }
}

---

LeetCode 257.二叉树的所有路径

文章讲解：代码随想录

视频讲解：递归中带着回溯，你感受到了没？| LeetCode：257. 二叉树的所有路径_哔哩哔哩_bilibili

力扣题目：LeetCode 257.二叉树的所有路径

 

 代码如下（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> res = new ArrayList<>();

        if(root == null){
            return res;
        }

        List<Integer> paths = new ArrayList<>();
        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();

            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);
        }
    }
}

---

LeetCode 404.左叶子之和

文章讲解：代码随想录

视频讲解：二叉树的题目中，总有一些规则让你找不到北 | LeetCode：404.左叶子之和_哔哩哔哩_bilibili

力扣题目： LeetCode 404.左叶子之和

 

代码如下（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 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 = midValue + leftValue + rightValue;

        return sum;
    }
}