4lineJavaRecursive


  • 0
    L

    public class Solution {
    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);
    }
    }


  • 0
    L

    is there any problem in my solution?


Log in to reply
 

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