Sum of Left Leaves 左叶子之和
[思路]:
此题的关键在于如何判断是否是左子叶。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int sumOfLeftLeaves(TreeNode* root) {
if( root == NULL) return 0;
if(root->left && !root->left->left && !root -> left->right) //判断是左子叶
return root->left->val +sumOfLeftLeaves(root -> right);
else
return sumOfLeftLeaves(root -> left)+ sumOfLeftLeaves(root -> right);
}
};