计算二叉树的叶子节点之和
样例
例1:
输入:
1
/ \
2 3
/
4
输出:7。
例2:
输入:
1
\
3
输出:3。
解题思路1:
遍历。
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: the root of the binary tree
* @return: An integer
*/
private int sum;
public int leafSum(TreeNode root) {
// write your code here
sum = 0;
helper(root);
return sum;
}
private void helper(TreeNode root){
if(root == null)
return;
if(root.left == null && root.right == null)
sum += root.val;
helper(root.left);
helper(root.right);
}
}
解题思路2:
分治。
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: the root of the binary tree
* @return: An integer
*/
public int leafSum(TreeNode root) {
// write your code here
if(root == null)
return 0;
int leftSum = leafSum(root.left);
int rightSum = leafSum(root.right);
if(leftSum == 0 && rightSum == 0)
return root.val;
return leftSum + rightSum;
}
}