摘要：
Given a BST, remove an extra edge to make it BST. 7 / \ 5 9 / \ / 3 8 阅读全文
摘要：
In this problem, a tree is an undirected graph that is connected and has no cycles. The given input is a graph that started as a tree with N nodes (wi 阅读全文