Path Sum | Coding Interview Question | LeetCode 112

Another easy LeetCode Question part of the LeetCode easy series. This question wants us to check whether the nodes in any #binary #tree path from the root to leaf add up to a target sum. To solve this we traverse the tree using #dfs while keeping track of a running sum. Happy coding!

TIMESTAMPS
--------------------------------------------------------------------------------------------------------
Illustration: 00:00
Complexity analysis: 04:42
Code: 05:50

QUESTION LINKS
---------------------------------------------------------------------------------------------------------
Difficulty: Easy

FIND ME HERE
--------------------------------------------------------------------------------------------------------