Dynamic Programming·DP on Trees·CoreThe longest path in a treeThe longest path between any two nodes of a tree is wanted.What is computed at each node?AThe longest path anywhere in its subtree, passed straight upBThe distance from this node to the root, compared across all nodesCThe number of nodes contained in its subtree, with the largest of those giving the answerDThe best downward reach, while separately tracking the best two joined at this nodeCheck answer