前序遍历
int sum;
int sumOfLeftLeaves(TreeNode* root) {
if(!root) return 0;
if(root->left) {
if (!root->left->left && !root->left->right) {
sum += root->left->val;
}
}
if (root->left) sumOfLeftLeaves(root->left);
if (root->right) sumOfLeftLeaves(root->right);
return sum;
}