Java recursive solution, detect the left leaves

  • 0
    public class Solution {
        public int sumOfLeftLeaves(TreeNode root) {
            //base case 
            if (root == null) {return 0;}
            if (root.left == null && root.right != null) return sumOfLeftLeaves(root.right);
            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.