Generation of binary trees from (0-1) codes

DOI10.1080/00207169208804058MaRDI QIDQ3989787zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 1992

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

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

zbMATH Keywords

backtrackingbinary treecoding schememonotonic order

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• On the generation of binary trees from (0–1) codes
• A note on the generation of binary trees
• Binary tree gray codes
• scientific article; zbMATH DE number 617583

Cites work

• A note on generating binary trees inA-order andB-order
• A numbering system for binary trees
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Lexicographic generation of ordered trees

Cited in

(12)

• Generating binary trees of bounded height
• On the generation of binary trees from (0–1) codes
• scientific article; zbMATH DE number 3959452 (Why is no real title available?)
• A New Algorithm for Generating Binary Trees using Rotations
• Constant-memory iterative generation of special strings representing binary trees
• A note on the generation of binary trees
• Generating trees withnnodes andmleaves
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• A taxonomy of binary tree traversals
• Generating binary trees using rotations
• Binary tree gray codes
• Single-crossover recombination and ancestral recombination trees

This page was built for publication: Generation of binary trees from (0-1) codes

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