/**
* 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 ans=0;
int sumOfLeftLeaves(TreeNode* root) {
stack<TreeNode*>s;
if(root==NULL)return 0;
TreeNode *p=root;
int ans=0;
while(p||!s.empty()){
if(p){
s.push(p);
if(p->left&&p->left->left==NULL&&p->left->right==NULL){
ans+=p->left->val;
}
p=p->left;
}else{
p=s.top();
s.pop();
p=p->right;
}
}
return ans;
}
};