Java Recursive Grandchild-Check 11ms


  • 0
    M
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public int sumOfLeftLeaves(TreeNode root) {
            if (root == null) {
                return 0;
            }
            if (root.left != null) {
                if (root.left.left == null && root.left.right == null) {
                    return root.left.val + sumOfLeftLeaves(root.right);
                }
            }
            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.