CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES

DOI10.1142/S0129054112400187zbMath1247.68215OpenAlexW2040539833MaRDI QIDQ2909202

Sebastian Smyczyński

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400187

zbMATH Keywords

231-avoiding permutationsenumeration of binary treesstack-sortable permutationstree permutations

Mathematics Subject Classification ID

Trees (05C05) Combinatorics on words (68R15) Enumeration in graph theory (05C30) Data structures (68P05)

Cites Work

• Unnamed Item
• Construction of a tree from its traversals in optimal time and space
• Stack sortable permutations
• A note on generating binary trees inA-order andB-order
• On enumerating tree permutations in natural order
• A numbering system for binary trees
• Generation of Binary Trees from Ballot Sequences

This page was built for publication: CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES