A note on the generation of binary trees
From MaRDI portal
Publication:4285646
DOI10.1080/00207169308804197zbMATH Open0797.68127OpenAlexW2022655857MaRDI QIDQ4285646FDOQ4285646
Authors:
Publication date: 17 March 1994
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169308804197
Recommendations
Trees (05C05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
Cited In (14)
- A note on trees, tables, and algorithms
- On the generation of binary trees from (0–1) codes
- A note on Rémy's algorithm for generating random binary trees
- Constant-memory iterative generation of special strings representing binary trees
- Binary tree gray codes
- Generating binary trees by Glivenko classes on Tamari lattices
- On the generation of binary trees inA-order
- Boundary of complete binary trees
- Generation and enumeration of all solutions of the characteristic sum condition
- On generating all binary trees
- On generating \(k\)-ary trees in computer representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur la génération des arbres binaires par les B-suites
This page was built for publication: A note on the generation of binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285646)