In this short talk we will present families of combinatorial classes that we call “trees with flowers”: they are trees with labelled nodes, and the labels are either integer partitions or integer compositions. We will give motivation to study such combinatorial structures and present asymptotic results. This work was supported by DGAPA-PAPIIT grants IN107718, IN110221, IN112725.