On the generation of binary trees inA-order
From MaRDI portal
Publication:4254656
DOI10.1080/00207169908804813zbMATH Open0926.68097OpenAlexW2060664390MaRDI QIDQ4254656FDOQ4254656
Authors:
Publication date: 29 November 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804813
Recommendations
Cites Work
- Generating binary trees by transpositions
- A note on generating binary trees inA-order andB-order
- Lexicographic generation of ordered trees
- Enumerating, Ranking and Unranking Binary Trees
- On Rotations and the Generation of Binary Trees
- Generation of Binary Trees from Ballot Sequences
- A note on the generation of binary trees
Cited In (10)
- A note on generating binary trees inA-order andB-order
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees by Glivenko classes on Tamari lattices
- Generating binary trees in A-order from codewords defined on a four-letter alphabet
- Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
- Generation, ranking and unranking of ordered trees with degree bounds
- Generating t-ary trees in A-order
- On generating \(k\)-ary trees in computer representation
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- Sur la génération des arbres binaires par les B-suites
This page was built for publication: On the generation of binary trees inA-order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254656)