Question: Given a binary tree, find a path (from root to a leaf) which gives maximum value by adding values of nodes.

Solution: Use DFS and keep maximum sum path.