Abstract: We say a divisien (S=SA∪SB, g) is equal if it divides set S into two subsets SA and SB satisfying f(SA)=f(SB), where f is som attribute function on these sets and SA∩SB need not be empty. In the present paper, we have obtained some equal divisions on set of ordered tree with n nodes:two equal divisions on tree set; two equal divisions on node set; two divisions on leaf set, one is equal, another one is "asymptotically" equal We conclude that, ordered tree set is on its good behavior in equal dividing.