Tree: Depth-First Search - Path Sum III (Any Path)
Given a binary tree and a target sum, you want to find the total number of paths where the sum of node values equals the target. Paths must move only from parent nodes to child nodes. Which technique is most suitable to solve this efficiently?
