112. Path Sum^Easy

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.

Problem
Solutions
- Groovy
- Java
- JavaScript
- Kotlin
- Python
- TypeScript