Java Solution,Sum of Left Leaves


  • 0
    L
    public class Solution {
        int sum = 0;
        public int sumOfLeftLeaves(TreeNode root) {
            if(root == null){
                return 0;
            }
            if(root.left != null&&root.left.left == null&&root.left.right == null){
               sum += root.left.val;
            }
            sumOfLeftLeaves(root.left);
            sumOfLeftLeaves(root.right);
            return sum;
        }     
    }
    

    ···


Log in to reply
 

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