We prove a best possible lower bound for the number of isomorphism classes into which all rooted spanning trees of a rooted cactus partition. We announce a best possible lower bound for the number of isomorphism classes into which all spanning trees of a cactus partition.