代码随想录训练营第三十五期|第17天|二叉树part04|● 110.平衡二叉树 ● 257. 二叉树的所有路径 ● 404.左叶子之和-CSDN博客

本文链接：https://blog.csdn.net/2301_78266314/article/details/137844645

本文介绍了三个与二叉树相关的LeetCode问题：如何判断平衡二叉树的高度，找到所有二叉树的路径表示，以及计算左叶子节点的和。使用了递归方法和深度优先搜索策略来解决这些问题。

摘要由CSDN通过智能技术生成

在getHeight过程中，避免重复计算，可以先判断

/**
 * 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 left = getHeight(root.left);
        if (left == -1) return -1;
        int right = getHeight(root.right);
        if (right == -1) return -1;
        if (Math.abs(left - right) > 1) return -1;
        return Math.max(left, right) + 1;
    }
}

257. 二叉树的所有路径 - 力扣（LeetCode）

path放的是路径

/**
 * 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> path = new ArrayList<>();
        backtracking(res, path, root);
        return res;
    }

    private void backtracking(List<String> res, List<Integer> path, TreeNode root) {
        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));
            res.add(sb.toString());
        }

        if (root.left != null) {
            backtracking(res, path, root.left);
            path.remove(path.size() - 1);
        }

        if (root.right != null) {
            backtracking(res, path,root.right);
            path.remove(path.size() - 1);
        }
    }
}

404. 左叶子之和 - 力扣（LeetCode）

/**
 * 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;
        if (root.left == null && root.right == null) return 0;
        int left = sumOfLeftLeaves(root.left);
        if (root.left != null && root.left.left == null && root.left.right == null) {
            left += root.left.val;
        }
        int right = sumOfLeftLeaves(root.right);
        int res = left + right;
        return res;
    }
}