Coding Trainer
Binary Tree Maximum Path Sum
Problem
Find the path in a binary tree with the maximum sum. The path can start and end at any node.
Example: root=[-10,9,20,null,null,15,7] → 42 (path: 15→20→7)