思路:
使用后序遍历的方法,判断节点是否为叶子节点,如果是叶子节点,则用该节点的根节点去获取该叶子节点的元素
该如何去判读该节点是否是左叶子,通过根节点来判断,如果该节点的的左右节点都为空,并且是上个节点的左节点,那么该节点就是左叶子。
/**
* 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 sumOfLeftLeaves(TreeNode* root) {
if(root == NULL) return 0;
if(root ->left == NULL && root ->right == NULL) return 0;
int l_s = sumOfLeftLeaves(root -> left);
if(root -> left != NULL && root -> left ->left == NULL && root -> left -> right == NULL){
l_s = root -> left -> val;
}
int r_s = sumOfLeftLeaves(root -> right);
return l_s + r_s;
}
};