sum-root-to-leaf-numbers——dfs

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int sumNumbers(TreeNode *root) {
13         if(root==NULL)
14             return 0;
15         res=0;
16         dfs(root,0);
17         return res;
18     }
19     void dfs(TreeNode *root,int num){
20         if(root!=NULL){
21             num=num*10+root->val;
22         }
23         if(root->left==NULL&&root->right==NULL){
24             res+=num;
25         }
26         if(root->left!=NULL){
27             dfs(root->left,num);
28         }
29         if(root->right!=NULL){
30             dfs(root->right,num);
31         }
32     }
33     int res;
34 };