Generation of Unordered Binary Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Generation of Unordered Binary Trees

Résumé

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.
Fichier non déposé

Dates et versions

hal-00174198 , version 1 (21-09-2007)

Identifiants

  • HAL Id : hal-00174198 , version 1

Citer

Brice Effantin. Generation of Unordered Binary Trees. International Conference on Computational Science and its Applications 2004, 2004, Assisi, Italy. pp.648-655. ⟨hal-00174198⟩
32 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More