404. Sum of Left Leaves

来源:互联网 发布:感染少女数据 编辑:程序博客网 时间:2024/04/30 21:22

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.
/** * 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.right == null&& root.left.left == null) {return root.left.val + sumOfLeftLeaves(root.right);}return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);    }}



0 0