java 3 If recursive solution. simplest in history.


  • 0
    T
    public class Solution {
         
        public int sumOfLeftLeaves(TreeNode root) {
            
            if(root==null)  
                return 0;
            else if(root.left!=null && root.left.left==null && root.left.right==null)
                return root.left.val + sumOfLeftLeaves(root.right);
            else 
                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.