Generating T-ary Trees in Linked Representation

Authors:
James F. Korsh
Affiliations:
Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA
Venue:
The Computer Journal
Year:
2005

Citing 0
Cited 3

On Generating All Binary Trees

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Ranking and unranking of non-regular trees with a prescribed branching sequence

Mathematical and Computer Modelling: An International Journal
On Generating All Binary Trees

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new algorithm for the generation of all n node t-ary trees in linked representation. It also gives two constant average time implementations of the algorithm. The first directly generates the next tree from its predecessor while the second retains additional information about the predecessor and is faster for t 4.