主题思想: 一个简单的递归遍历,是后序遍历,先左子树,再由子树,如果一个节点是叶子节点,则返回当前根到叶子节点代表的值,如果是非叶子节点,则返回左右子树和的值
AC 代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int sumNumbers(TreeNode root) {
if(root==null) return 0;
int sum=0;
sum=dfs(root,0);
return sum;
}
public int dfs(TreeNode node,int num){
int left=0;
int right=0;
if(node.left!=null) left=dfs(node.left,num*10+node.val);
if(node.right!=null) right=dfs(node.right,num*10+node.val);
if(node.left==null&&node.right==null) {
return num*10+node.val;
}else return left+right;
}
}