Simplest and Fastest Java Solution. Beats 99.99% solutions


  • 0
    O

    public int sumOfLeftLeaves(TreeNode root) {

        if(root == null)
            return 0;
        
        int left=0;
        if(root.left != null && (root.left.left == null && root.left.right == null))
            left = root.left.val;
            
        return left + 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.