leetCode: binary tree sum

题目是：有一颗二叉树，每个节点都是0～9的一个数字，然后从根节点到叶子节点作为一个整数，然后把所有叶子节点对应的整数相加

#include<iostream>
using namespace std;
struct TreeNode
{
    int val;
    TreeNode * left;
    TreeNode * right;
    TreeNode(int x):val(x),left(NULL),right(NULL)   { }
};
class Solution{
public:
    //-------------PreOerder Recursive----------------
    //----myabe the pre-order is the only right order---
    int sumNumbers_PreOrder_Recur(TreeNode *root){};

 };

 int sumNumbers_PreOrder_Recur(TreeNode *root,int val){
     if(root==NULL)
         return 0;
     val=val*10+root->val;
     if(root->left==NULL && root->right==NULL){
         return val;
     }
     return sumNumbers_PreOrder_Recur(root->left,val)+sumNumbers_PreOrder_Recur(root->right,val);
}

int main(){
    TreeNode a=TreeNode(1);
    TreeNode b=TreeNode(2);
    TreeNode c=TreeNode(3);
    TreeNode d=TreeNode(4);
    TreeNode e=TreeNode(5);
    a.left=&e;a.right=&b;
    b.left=&c;b.right=&d;
    e.left=NULL;e.right=NULL;d.left=NULL;d.right=NULL;e.left=NULL;e.right=NULL;

    int result=sumNumbers_PreOrder_Recur(&a,0);
    cout<<"the result is :"<<result<<endl;//the output should be 262

    return 1;
}