1、Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.
Example:
3
/ \
9 20
/ \
15 7
There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
/**
* 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, bool aa = false){
if (!root) return 0;
if (!root->left && !root->right) return aa ? root->val : 0;
return sumOfLeftLeaves(root->left, true) + sumOfLeftLeaves(root->right, false);
}
};
刚开始以为要把所有的左边的节点值都加起来,打算把每个root后的left和right->left的val相加,当为空时,返回0,酱紫做递归运算,结果发现right->left是个bug,会因为right为空导致right->left内存访问错误。
后来发现理解错了,只需要判断最后的一层叶子,把左叶子加起来就好了,判断最后一层叶子!root->left && !root->right,递归加个判断,如果是root->left变root就返回val,root->right的话就加0,root->right变root后的root->left就是最初的root->right->left。