Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree.

Find the maximum sum path in a tree from root to leaf node.

• Start from the root node and traverse down to leaf nodes, keeping track of the sum at each node.

• At each node, compare the sum of the current ...read more