the above operations can now be used to enumerate common combinatorial objects including trees (binary and plane), dyck paths and cycles. a combinatorial structure is composed of atoms. for example, with trees the atoms would be the nodes. the atoms which compose the object can either be labeled or unlabeled. unlabeled atoms are indistinguishable from each other, while labelled atoms are distinct. therefore, for a combinatorial object consisting of labeled atoms a new object can be formed by simply swapping two or more atoms.