Generation of binary trees from (0-1) codes

DOI10.1080/00207169208804058zbMATH Open0742.68024OpenAlexW2022225347MaRDI QIDQ3989787FDOQ3989787

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

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

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)

Cites Work

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

Cited In (12)

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

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)