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