LEET code -- Path Sum

 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
For example:
Given the below binary tree and sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool hasPathSum(struct TreeNode* root, int sum) { if(root==NULL)return false; int ans=sum-root->val; if(root->left==NULL && root->right==NULL && ans==0)return true; else if(root->left==NULL && root->right==NULL && ans!=0)return false; bool le=hasPathSum(root->left,sum-root->val); bool ri=hasPathSum(root->right,sum-root->val); if(le | ri)return true; else return false; }