On enumerating tree permutations in natural order

DOI10.1080/00207168708803585MaRDI QIDQ3804211zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1987

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168708803585

zbMATH Keywords

binary treeenumerationlexicographical ordernatural ordertree permutations

Mathematics Subject Classification ID

Data structures (68P05) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Constant-memory iterative generation of special strings representing binary trees
• scientific article; zbMATH DE number 4062616
• Generating ordered trees
• Efficient enumeration of ordered trees with \(k\) leaves
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)

Cites work

• A Note on Generating Well-formed Parenthesis Strings Lexicographically
• A numbering system for binary trees
• Generation of all the balanced parenthesis strings in lexicographical order
• Generation of Binary Trees from Ballot Sequences
• scientific article; zbMATH DE number 3757724 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Lexicographic generation of ordered trees
• Ranking and Listing Algorithms for k-Ary Trees

Cited in

(4)

• Constant-memory iterative generation of special strings representing binary trees
• Classes of Admissible Permutations that are Generatable by Depth-first Traversals of Ordered Trees
• Increasing trees and alternating permutations
• scientific article; zbMATH DE number 4187815 (Why is no real title available?)

This page was built for publication: On enumerating tree permutations in natural order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804211)