On enumerating tree permutations in natural order

DOI10.1080/00207168708803585zbMath0656.68074OpenAlexW2035731134MaRDI QIDQ3804211

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 treeenumerationnatural orderlexicographical ordertree permutations

Mathematics Subject Classification ID

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

Related Items (1)

CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Lexicographic generation of ordered trees
• Generation of all the balanced parenthesis strings in lexicographical order
• A Note on Generating Well-formed Parenthesis Strings Lexicographically
• A numbering system for binary trees
• Generation of Binary Trees from Ballot Sequences
• Ranking and Listing Algorithms for k-Ary Trees

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