Abstract: Let X be a finite set and F the collection of all nonempty proper subsets of X. A subset F of F is called a tree of subsets of X if A,B ∈F implies A ∩ B ∈ {∅,A,B}. In this paper, the maximum trees of subsets of a finite set are obtained.