LeetCode 685: Redundant Connection II
Problem Restatement We are given a directed graph that started as a rooted tree with n nodes. A rooted tree has these properties: Property Meaning One root Exactly one node has no parent One parent per non-root node Every other node has exactly one parent Reachability Every node is reachable from the root No cycle Following directed edges never loops Then one extra directed edge was added. We need to...