LeetCode 404. Sum of Left Leaves 题解(C++)
题目描述
- Find the sum of all left leaves in a given binary tree.
示例
There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
思路
解法1
- 使用BFS(广度优先搜索)算法实现。创建一个存放树结点的队列和存放bool值(用于标示是否为左结点)的队列,并把根节点入队列,同时false入队列(这里在前面已经判断结点不是空结点,所以这里的标记为false)。之后当队列不为空时,每次分别从两个队列取出一个结点和一个bool值,判断该结点的左右子树是否为空且bool值为true,是则为左叶子结点。之后判断左子树不为空,则左子树结点入队列且置bool值为true,若右子树结点不为空,则右子树结点入队列且置bool值为false。
解法2
- 使用递归实现。当左子树不为空,且左子树的左结点和右节点均为空时,则该结点为左叶子结点, 否则将左子树递归;而右子树则不需要进行判断是否为左叶子结点,若右子树不为空,则对右子树进行递归。
代码
解法1
class Solution
{
public:
int sumOfLeftLeaves(TreeNode* root)
{
if (root == NULL)
{
return 0;
}
int leftLeavesSum = 0;
queue<bool> isLeft;
queue<TreeNode*> treeQueue;
treeQueue.push(root);
isLeft.push(false);
while (!treeQueue.empty())
{
TreeNode *temp = treeQueue.front();
treeQueue.pop();
bool tIsLeft = isLeft.front();
isLeft.pop();
if (temp->left == NULL && temp->right == NULL && tIsLeft == true)
{
leftLeavesSum += temp->val;
}
if (temp->left != NULL)
{
treeQueue.push(temp->left);
isLeft.push(true);
}
if (temp->right != NULL)
{
treeQueue.push(temp->right);
isLeft.push(false);
}
}
return leftLeavesSum;
}
};
解法2
class Solution
{
public:
int sumOfLeftLeaves(TreeNode* root)
{
if (root == NULL)
{
return 0;
}
int leftLeavesSum = 0;
if (root->left != NULL)
{
if (root->left->left == NULL && root->left->right == NULL)
{
leftLeavesSum += root->left->val;
}
else
{
leftLeavesSum += sumOfLeftLeaves(root->left);
}
}
if (root->right != NULL)
{
leftLeavesSum += sumOfLeftLeaves(root->right);
}
return leftLeavesSum;
}
};