find the longest subarray in which the difference between the max and min

dfs,

dfs, compute height and check for balance

dfs, keeping track of the sum of node values. return true if the sum equals `targetSum` at any leaf