首页 > 代码库 > [leetcode-404-Sum of Left Leaves]
[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.
思路：
递归遍历，判断是左叶子加入sum.
void tr(TreeNode* root, int& sum) { if (root == NULL)return; if (root->left != NULL && root->left->left == NULL && root->left->right == NULL)sum += root->left->val; tr(root->left, sum); tr(root->right, sum); } int sumOfLeftLeaves(TreeNode* root) { if (root == NULL)return 0; int sum = 0; tr(root, sum); return sum; }
[leetcode-404-Sum of Left Leaves]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。