首页 > 代码库 > LeetCode - 404. Sum of Left Leaves
LeetCode - 404. Sum of Left Leaves
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 { private int sum; public int sumOfLeftLeaves(TreeNode root) { if (root == null) return 0; if (root.left == null && root.right == null) return 0; solve(root); return sum; } private void solve(TreeNode root) { if (root == null) return ; if (root.left != null) { if (root.left.left == null && root.left.right == null) sum += root.left.val; } solve(root.left); solve(root.right); }}
LeetCode - 404. Sum of Left Leaves
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。