LeetCode-404. Sum of Left Leaves

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.

统计所有右叶子结点val的和。我用的BFS，结点入队前先判断这个结点的左孩子是否是叶子结点。

/**
 * 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;
        int sum = 0;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()) {
            TreeNode* curNode = q.front();
            q.pop();
            if(curNode->left) {
                q.push(curNode->left);
                if( curNode->left->left == NULL && curNode->left->right == NULL ) {
                    sum += curNode->left->val;
                }
            }
            if(curNode->right) {
                q.push(curNode->right);
            }
        }
        return sum;
    }
};