2019年6月22日
delete an extra edge from BST
摘要： Given a BST, remove an extra edge to make it BST. 7 / \ 5 9 / \ / 3 8 阅读全文
posted @ 2019-06-22 11:25 北叶青藤 阅读(328) 评论(0) 推荐(0)
Redundant Connection
摘要： 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 阅读全文
posted @ 2019-06-22 10:46 北叶青藤 阅读(216) 评论(0) 推荐(0)