This is questions from algorithms..
Tree is a special type of graph, in which there is exactly one path between every pair of nodes. By removing nodes from a tree, we separate it into many small subtrees. Given a tree T=(V,E) consisting of n nodes and m edges and an integer k