https://leetcode.com/problems/sum-of-left-leaves/
解题思路:
思路就是遍历整棵树,遇到左子节点的叶子节点就记录下来,最后输出整个结果。这里有递归和迭代两种方法,要注意下细节。
solution 1 : recursive
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if (root == null) return 0;
if (root.left != null && root.left.left == null && root.left.right == null)
return root.left.val + sumOfLeftLeaves(root.right);
return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
}
}
solution 2 : iterative
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if (root == null) return 0;
int result = 0;
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while (!stack.isEmpty()) {
root = stack.pop();
if (root.left != null) {
if (root.left.left == null && root.left.right == null) {
result += root.left.val;
} else {
stack.push(root.left);
}
}
if (root.right != null) {
if (root.right.left != null || root.right.right != null)
stack.push(root.right);
}
}
return result;
}
}