Quiz: Path Problems

Max Path Sum in tree: Find the maximum sum path (any start/end). For node $v$, you compute best path going DOWN. How do you handle paths that go through $v$ (down one subtree, up, down another)?

1. A.Process leaves only
2. B.Ignore such paths, only consider root-to-leaf
3. C.Use BFS instead of DFS
4. D.Combine top $2$ down-paths from children at each node