
int sumNumbers(TreeNode *root)
{
return dfs(root, );
}
int dfs(TreeNode *root, int sum)
{
if (root == nullptr)return ; if (root->left == nullptr && root->right == nullptr)
return sum * + root->val; return dfs(root->left, sum * + root->val) + dfs(root->right, sum * + root->val);
}