LeetCode – Path Sum II (Java)
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example, given the below binary tree and sum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1 the method returns the following: [ … Read more