A binary unordered tree is a tree where each internal node has two children and the relative order of the subtrees of a node is not important (i.e. two trees are different if they differ only in the respective ordering of subtrees of nodes). We present a new method to generate all binary rooted unordered trees with n internal nodes, without duplications, in O(log n) time. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Effantin, B. (2004). Generation of unordered binary trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 648–655. https://doi.org/10.1007/978-3-540-24767-8_68
Mendeley helps you to discover research relevant for your work.