2 line concise JAVA


  • 2
    M
        public int sumOfLeftLeaves(TreeNode root) {
            if(root==null) return 0;
            return (root.left!=null&&root.left.left==null&&root.left.right==null?root.left.val:0)+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.