C++ simple solution


  • 1
    B
    class Solution {
    public:
        bool hasPathSum(TreeNode* root, int sum) {
            if (root == NULL) {
                return false;
            }
            // reach leaf node
            if (root->val == sum && 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.