Leetcode 404. Sum of Left Leaves (Easy) (cpp)

Niko_Ke

于 2016-11-29 07:41:39 发布

阅读量455

点赞数

分类专栏： Leetcode C++ C++ Leetcode Tree 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53388537

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Tree

48 篇文章 0 订阅

订阅专栏

Leetcode 404. Sum of Left Leaves (Easy) (cpp)

Tag: Tree

Difficulty: Easy

/*

404. Sum of Left Leaves (Easy)

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.

*/
/**
* 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) {
		int res = 0;
		sumOfLeftLeaves(root, NULL, res);
		return res;
	}
private:
	void sumOfLeftLeaves(TreeNode* root, TreeNode* pre, int& res) {
		if (root == NULL) {
			return;
		}
		else if (pre == NULL) {
			sumOfLeftLeaves(root->left, root, res);
			sumOfLeftLeaves(root->right, root, res);
		}
		else if (root->left == NULL && root->right == NULL && pre->left == root) {
			res += root->val;
			return;
		}
		else {
			sumOfLeftLeaves(root->left, root, res);
			sumOfLeftLeaves(root->right, root, res);
		}

	}
};