3 line Java solution


  • 0
    C
        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);
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.