Quiz: Max White Subtree

Each node is black ($-1$) or white ($+1$). For each node, find the maximum sum of any connected subtree containing it. What technique do you use?

1. A.BFS level-order traversal
2. B.Find centroids first
3. C.Single DFS from any root
4. D.Rerooting DP