LeetCode 112 | Path Sum #100daysofcoding #leetcodechallenge #javaprogramming

We need to checks if there exists a path from the root to a leaf in a binary tree such that the sum of the values along the path equals a given `targetSum`. It does this by recursively traversing the tree. If the current node is `null`, it returns `false`. If a leaf node (a node with no children) is reached and its value equals the remaining `targetSum`, it returns `true`. Otherwise, it continues the search on both left and right subtrees with the updated target sum.