On the generation of binary trees from (0–1) codes

DOI10.1080/00207169808804721zbMath0926.68096OpenAlexW2005957644MaRDI QIDQ4256127

No author found.

Publication date: 1998

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

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On the generation of binary trees from (0–1) codes ⋮ Unnamed Item ⋮ Generation oft-ary trees with Ballot-sequences^*

Cites Work

• Generating binary trees of bounded height
• Lexicographic generation of ordered trees
• Generating binary trees by transpositions
• Binary tree gray codes
• A note on generating binary trees inA-order andB-order
• Generation of binary trees from (0-1) codes
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• On the generation of binary trees from (0–1) codes
• On Rotations and the Generation of Binary Trees
• A note on the generation of binary trees

This page was built for publication: On the generation of binary trees from (0–1) codes