A leetcode question on DFS and with memoization. Given an undirected tree, You're asked to find the maximum node value sum on any path (path comprising of connected nodes) which goes in one direction (in other words, two nodes in the path don't have the same height or depth)