On generating k-ary trees in computer representation

On generating k-ary trees in computer representation

Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., in compupter representation. Two new algorithms are presented in this paper to generate k-ary trees in computer representation. One is recursive with constant average time per tree...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2001-03, Vol.77 (5-6), p.231-238
Hauptverfasser: LIMIN XIANG, USHIJIMA, Kazuo, CHANGJIE TANG
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Information processing
Mathematical models
Mathematics
Sciences and techniques of general use
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., in compupter representation. Two new algorithms are presented in this paper to generate k-ary trees in computer representation. One is recursive with constant average time per tree and the other is loopless (non-recursive) with constant time per tree. Both of them are simple and able to be understood easily.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00155-1