Question:
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.
Solution:
一开始以为是要找所有左节点的值的和,后来发现是所有左叶子。
简单递归遍历整棵树就好,遇到左节点是叶子就把值加上去。再对左右节点遍历(如果不为空)。
特别注意root为空的情况,一开始输入空数的话。
时间复杂度:O(n)
空间复杂度:O(1)
/**
* 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) return 0;
if (!root->left && !root->right) return 0;
if (!root->left) return sumOfLeftLeaves(root->right);
if (!root->left->left && !root->left->right)
return root->left->val + sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
}
};