A note on generating binary trees inA-order andB-order
From MaRDI portal
Publication:3802638
Recommendations
Cites work
- scientific article; zbMATH DE number 3757724 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- A Note on Generating Well-formed Parenthesis Strings Lexicographically
- A numbering system for binary trees
- Constant Time Generation of Rooted Trees
- Enumerations of ordered trees
- Enumerations of rooted trees with an application to group presentations
- Generating Binary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
- Generation of Binary Trees from Ballot Sequences
- Lexicographic generation of ordered trees
- On a correspondence between binary trees and a certain type of permutation
- Ranking and Listing Algorithms for k-Ary Trees
- Ranking and unranking of B-trees
- Sur la génération des arbres binaires par les B-suites
Cited in
(32)- Generation oft-ary trees with Ballot-sequences*
- Ranking and Unranking of AVL-Trees
- On the generation of binary trees from (0–1) codes
- A note on the generation of binary trees
- Enumerating, Ranking and Unranking Binary Trees
- Generating trees withnnodes andmleaves
- Coding Binary Trees by Words over an Alphabet with Four Letters
- On the generation ofP-sequences
- A new algorithm for generation of different types of RNA
- Constant-memory iterative generation of special strings representing binary trees
- Ranking and Unranking of Non-regular Trees
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- Two shortest path metrics on well-formed parentheses strings
- Chains with small intervals in the lattice of binary paths
- Parallel generation of í-ary trees with ballot-sequences
- A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- On the generation of binary trees inA-order
- Generating binary trees in A-order from codewords defined on a four-letter alphabet
- Generation of binary trees from (0-1) codes
- Generation, ranking and unranking of ordered trees with degree bounds
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- Generating t-ary trees in A-order
- Loopless generation of \(k\)-ary tree sequences
- Matchings In Three Catalan Lattices
- On generating \(k\)-ary trees in computer representation
- The number of coverings in four catalan lattices
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Rational languages defined with a non-associative concatenation
- Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.
- A lattice on Dyck paths close to the Tamari lattice
- Sur la génération des arbres binaires par les B-suites
This page was built for publication: A note on generating binary trees inA-order andB-order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802638)
