<Interview Problem>二叉树根到叶节点求和值匹配

题目大意：一颗二叉树，每个节点都有一个Value, 判断根节点到叶节点的路径求和值是否等于某个数Sum.

比如说如下这样一颗二叉树，76是45，21,10这条路径的求和值，77就没有满足条件的路径。

45

21            65

10    24      50   70

代码依旧用C++来实现，二叉树一般采用递归的方式来解决。

 #include <iostream>

 using namespace std;

 typedef struct BTree

 {
         int value;
         struct BTree* left;
         struct BTree* right;
 } BTree;
 typedef struct BTree Node;

 //recursively insert a tree node   

 BTree* Insert(BTree* T, int value)
 {
       if(T == NULL)
       {
         T = (BTree*)malloc(sizeof(struct BTree));
         if(T == NULL)
                 printf("Malloc failed");
         else{
                 T->value = value;
                 T->left = T->right = NULL;
         }
       }
       else if(value < T->value)
         T->left = Insert(T->left,value);
       else if(value > T->value)
         T->right = Insert(T->right,value);
       return T;
 }
 BTree* MakeEmpty(BTree* T)
 {
         if(T != NULL){
                 MakeEmpty(T->left);
                 MakeEmpty(T->right);
                 free(T);
         }
         return NULL;
 }

 bool hasPathSum( Node *node, int sum, int pathSum)
 {
         bool match = false;
         if(node != NULL)
                 pathSum += node->value;
         if(node->left== NULL && node->right == NULL)
         {
                 if(sum == pathSum)
                         match = true;
                 else
                         match = false;
         }
         if(node->left != NULL && !match)
                 match = hasPathSum(node->left,sum,pathSum);
         if(node->right != NULL && !match)
                 match = hasPathSum(node->right,sum,pathSum);
         return match;
 }
 bool hasPathSum( Node *root, int sum)
 {
         if(root == NULL) return false;
          bool match = false;
          match = hasPathSum(root,sum,);
          return match;
 }
 int main()
 {
         BTree* T = NULL;
         T = Insert(T,);
         T = Insert(T,);
         T = Insert(T,);
         T = Insert(T,);
         T = Insert(T,);
         T = Insert(T,);
         T = Insert(T,);
         bool match = hasPathSum(T,);
         cout << match << endl;
         match = hasPathSum(T,);
         cout << match << endl;
         MakeEmpty(T);
         return ;
 }