/**

  * Definition for binary tree

  * struct TreeNode {

  *     int val;

  *     TreeNode *left;

  *     TreeNode *right;

  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

  * };

  */

 class Solution {

 public:

     int sumNumbers(TreeNode *root) {

         if(root==NULL)

             return ;

         res=;

         dfs(root,);

         return res;

     }

     void dfs(TreeNode *root,int num){

         if(root!=NULL){

             num=num*+root->val;

         }

         if(root->left==NULL&&root->right==NULL){

             res+=num;

         }

         if(root->left!=NULL){

             dfs(root->left,num);

         }

         if(root->right!=NULL){

             dfs(root->right,num);

         }

     }

     int res;

 };