Abstract: Two problems of tree partition with some fixed vertices were considered in this paper,i.e.min-sum tree partition with fixed k vertices and min-max tree partition with fixed k vertices,the following results were obtained,① there exists an optimal and polynomial algorithm to the first problem;② the second problem was proved to be NP-hard,and there exists a k-approximate algorithm to the second problem.