Constant-memory iterative generation of special strings representing binary trees

DOI10.1142/S0129054112400187zbMATH Open1247.68215OpenAlexW2040539833MaRDI QIDQ2909202FDOQ2909202

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2013206
• On the loopless generation of binary tree sequences
• A note on the generation of binary trees
• scientific article; zbMATH DE number 434865
• A loopless algorithm for generating binary tree sequences
• Generation of binary trees from (0-1) codes
• Recursive generation of \(k\)-ary trees
• Loopless generation of \(k\)-ary tree sequences
• On succinct representations of binary trees

zbMATH Keywords

231-avoiding permutationsenumeration of binary treesstack-sortable permutationstree permutations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on generating binary trees inA-order andB-order
• Stack sortable permutations
• A numbering system for binary trees
• Generation of Binary Trees from Ballot Sequences
• Construction of a tree from its traversals in optimal time and space
• On enumerating tree permutations in natural order

Cited In (5)

• Scaffold permutations
• On enumerating tree permutations in natural order
• String Processing and Information Retrieval
• Title not available (Why is that?)
• Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time

This page was built for publication: Constant-memory iterative generation of special strings representing binary trees

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