C++ | Leetcode C++题解之第404题左叶子之和

题目：

题解：

class Solution {
public:bool isLeafNode(TreeNode* node) {return !node->left && !node->right;}int sumOfLeftLeaves(TreeNode* root) {if (!root) {return 0;}queue<TreeNode*> q;q.push(root);int ans = 0;while (!q.empty()) {TreeNode* node = q.front();q.pop();if (node->left) {if (isLeafNode(node->left)) {ans += node->left->val;}else {q.push(node->left);}}if (node->right) {if (!isLeafNode(node->right)) {q.push(node->right);}}}return ans;}
};