求根到叶子节点数字之和
![在这里插入图片描述](https://img-blog.csdnimg.cn/20190814205841899.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poYW9ob3V0YW8=,size_16,color_FFFFFF,t_70)
/**
* 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:
void shu(TreeNode* root, int& sum, int temp)
{
//递归模式
if(root==NULL)
{
sum=0;
return;
}
if (root->left == NULL&&root->right == NULL)
{
sum = sum + temp*10+root->val;
return;
}
if (root->left != NULL)
shu(root->left, sum, temp * 10 + root->val);
if (root->right != NULL)
shu(root->right, sum, temp * 10 + root->val);
}
int sumNumbers(TreeNode* root) {
int sum = 0;
int temp = 0;
shu(root, sum, temp);
return sum;
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/20190814205900370.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poYW9ob3V0YW8=,size_16,color_FFFFFF,t_70)