LeetCode 404 Sum of Left Leaves

来源:互联网 发布:免费刷手机流量软件 编辑:程序博客网 时间:2024/06/05 06:21

Find the sum of all left leaves in a given binary tree.

Example:

    3   / \  9  20    /  \   15   7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

求二叉树的所有左边叶子的和。

public int sumOfLeftLeaves(TreeNode root) {if (root == null) return 0;int leaf = 0;if (root.left != null && root.left.right == null && root.left.left == null)leaf = root.left.val;return leaf + sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);}



0 0