给定1 棵有n 个结点的树T。子树分割问题要求从树T 中删除尽可能少的边得到一个恰有k 个结点的连通分支。 -There is a given n nodes of the tree T. Subtree the division of T from the tree to remove as far as possible, get a little edge there are exactly k nodes branch connectivity.