Given a directed graph (represented as a tree with directed edges), choose a root node such that the minimum number of edges must be reversed so that all edges point away from the root.

Return the best root node (any valid one if multiple exist). ...