Efficient Generation of k-ary Trees in Natural Order
From MaRDI portal
Publication:4019956
DOI10.1093/comjnl/35.3.306zbMath0757.68035MaRDI QIDQ4019956
Publication date: 16 January 1993
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/35.3.306
68P05: Data structures
Related Items
Generating binary trees in A-order from codewords defined on a four-letter alphabet, Unnamed Item, Ranking and unranking of non-regular trees with a prescribed branching sequence, Loopless generation of \(k\)-ary tree sequences, On generating \(k\)-ary trees in computer representation, Parallel generation of í-ary trees with ballot-sequences, A new algorithm for generation of different types of RNA