计算给定二叉树的所有左叶子之和。
public int sumOfLeftLeaves(TreeNode root) {
int num=0;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()){
TreeNode node = queue.poll();
if (node == null) continue;
if (node.left != null && node.left.left == null && node.left.right == null) {
num += node.left.val;
}else {
queue.addFirst(node.left);
}
queue.addFirst(node.right);
}
return num;
}
public int sumOfLeftLeaves(TreeNode root) {
if (root == null) return 0;
int sum =0;
if (root.left != null && root.left.left == null && root.left.right == null){
sum += root.left.val;
}
return sum + sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
}