The scalefree nature of a scalefree network yields uneven distribution of connections (degrees) between its nodes. As the topological structures of scalefree networks are not exactly figured up to now

people can not observe clearly paths of information dissemination in scalefree networks. Based on the idea of using spanning trees in researching topological structures of scale-free networks

the universal structure of scalefree networks without relating time and subnodes are tried to find

and balanced sets that are extensively related with spanning trees in the networks are researched

and furthermore show an algorithm for finding spanning trees with more leaves.