# Leetcode 112 - Path sum

Note:

• Backtracking is easy but slower.
• Recursion is quicker and it’s intuitive to use || operator.

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.

A leaf is a node with no children.

Example

Backtracking

Recursion