给定二叉树的根节点 root
,返回所有左叶子之和。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int res = 0;
int sumOfLeftLeaves(TreeNode* root) {
if(root==nullptr) return res;
if(root->left!=nullptr&&root->left->left==nullptr&&root->left->right==nullptr)
res+=root->left->val;
sumOfLeftLeaves(root->left);
sumOfLeftLeaves(root->right);
return res;
}
};
思路:
看了评论区好多方法,感觉前序遍历才是符合正常逻辑思维的,而且效率极高