Just the code. This is a very easy one. Using DFS ALG
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void calcSum(TreeNode *node, int &sum, int &res) {
if (node->left == NULL && node->right == NULL) {
res += sum;
return;
}
if (node->left != NULL) {
sum = sum * 10 + node->left->val;
calcSum(node->left, sum, res);
sum = (sum - node->left->val)/10;
}
if (node->right != NULL) {
sum = sum * 10 + node->right->val;
calcSum(node->right, sum, res);
sum = (sum - node->right->val)/10;
}
}
int sumNumbers(TreeNode *root) {
if (root == NULL)
return 0;
int sum, res;
res = 0;
sum = root->val;
calcSum(root, sum, res);
return res;
}
};