Give a linear-time algorithm to test whether a tree has a perfect matching, that is, a set of edges that touches each vertext of the tree exactly once. Give a linear-time algorithm to test whether a
阅读背景：
如何测试树在线性时间内是否具有完美匹配？
来源：互联网
分享到：
