Path Sum

  1. 问题

    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.

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


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012201343/article/details/49948465
文章标签: 二叉树
个人分类: LeetCode
上一篇Populating Next Right Pointers in Each Node II
下一篇Kth Smallest Element in a BST
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭