Related tops: DFS & Recursion
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
,5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1return true, as there exist a root-to-leaf path
5->4->11->2
which sum is 22.
public boolean hasPathSum(TreeNode root, int sum) {
//exit1 of recursion, this is the child node of a leaf node, of course it's null
if (root == null) return false;
//exit2 of recursion, this is a leaf node, of course its child node is null. If the node value equals sum, it returns true.
if (root.left == null && root.right == null && root.val == sum) return true;
//if the left sub-tree or the right sub-tree 'has path sum'
return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right,sum - root.val);
}