题目链接: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;
}
}
3 复杂度分析
时间复杂度:
空间复杂度:
4 涉及到知识点
收获和总结
1.遇到的困难?
2 收获
学习链接
https://programmercarl.com/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.html#%E6%80%9D%E8%B7%AF