LeetCode - Path Sum

Problem statement 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 equal targetSum. A leaf is a node with no children. Problem statement taken ...