C++ recursive solution easy to understand


  • 3
    H

    class Solution {
    public:

    bool hasPathSum(TreeNode* root, int sum) {
        if(root == NULL ){
            return false;
        }
        if(sum == root->val && root->left== NULL && root->right == NULL){
            return true;
        }
        return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
    }
    

    };


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.