leetcode | 685. Redundant Connection Ⅱ

題目 In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, ex

>>阅读原文<<