Description
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.
- Note:
A leaf is a node with no children.
- Example:
Given the below binary tree and sum = 22,
1 | 5 |
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
Solution
1 | func hasPathSum(root *TreeNode, sum int) bool { |
Note
假設有以下參數:
1 | root: [5, 4, 11, 7, 2, 8, 13, 4, 1] |
說明:
1 | 樹的形狀如下: |