On the generation of binary trees inA-order
From MaRDI portal
Publication:4254656
Recommendations
Cites work
- A note on generating binary trees inA-order andB-order
- A note on the generation of binary trees
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees by transpositions
- Generation of Binary Trees from Ballot Sequences
- Lexicographic generation of ordered trees
- On Rotations and the Generation of Binary Trees
Cited in
(10)- Generation, ranking and unranking of ordered trees with degree bounds
- A note on generating binary trees inA-order andB-order
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- On generating \(k\)-ary trees in computer representation
- Enumerating, Ranking and Unranking Binary Trees
- Generating t-ary trees in A-order
- Generating binary trees in A-order from codewords defined on a four-letter alphabet
- Generating binary trees by Glivenko classes on Tamari lattices
- Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
- 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)