Path Sum

#112
Easy
Binary Tree
O(n)
O(h)
Amazon
Microsoft
Google
View on LeetCode

Problem Description

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.