Leetcode 404. Sum of Left Leaves-CSDN博客

本文链接：https://blog.csdn.net/weixin_42542290/article/details/127813308

本文介绍了两种方法解决LeetCode题目：计算二叉树中所有左叶子节点值的和。方法一是递归，展示了如何遍历并累计值；方法二是迭代，通过逐层遍历优化空间复杂度。学习了如何处理空节点和判断是否为左叶子节点的关键条件。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：https://leetcode.cn/problems/sum-of-left-leaves/

方法一递归

1 方法思想

2 代码实现

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

}

3 复杂度分析

时间复杂度：
空间复杂度：

4 涉及到知识点

方法二迭代

1 方法思想

2 代码实现

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

}